CF #459 D. MADMAX
1 second
256 megabytes
standard input
standard output
As we all know, Max is the best video game player among her friends. Her friends were so jealous of hers, that they created an actual game just to prove that she's not the best at games. The game is played on a directed acyclic graph (a DAG) with n vertices and m edges. There's a character written on each edge, a lowercase English letter.

Max and Lucas are playing the game. Max goes first, then Lucas, then Max again and so on. Each player has a marble, initially located at some vertex. Each player in his/her turn should move his/her marble along some edge (a player can move the marble from vertex v to vertex u if there's an outgoing edge from v to u). If the player moves his/her marble from vertex v to vertex u, the "character" of that round is the character written on the edge from v to u. There's one additional rule; the ASCII code of character of round i should be greater than or equal to the ASCII code of character of round i - 1 (for i > 1). The rounds are numbered for both players together, i. e. Max goes in odd numbers, Lucas goes in even numbers. The player that can't make a move loses the game. The marbles may be at the same vertex at the same time.
Since the game could take a while and Lucas and Max have to focus on finding Dart, they don't have time to play. So they asked you, if they both play optimally, who wins the game?
You have to determine the winner of the game for all initial positions of the marbles.
The first line of input contains two integers n and m (2 ≤ n ≤ 100,
).
The next m lines contain the edges. Each line contains two integers v, u and a lowercase English letter c, meaning there's an edge from v to u written c on it (1 ≤ v, u ≤ n, v ≠ u). There's at most one edge between any pair of vertices. It is guaranteed that the graph is acyclic.
Print n lines, a string of length n in each one. The j-th character in i-th line should be 'A' if Max will win the game in case her marble is initially at vertex i and Lucas's marble is initially at vertex j, and 'B' otherwise.
4 4
1 2 b
1 3 a
2 4 c
3 4 b
BAAA
ABAA
BBBA
BBBB
5 8
5 3 h
1 2 c
3 1 c
3 2 r
5 1 r
4 3 z
5 4 r
5 2 h
BABBB
BBBBB
AABBB
AAABA
AAAAB
题意:给你一个有向无环图,两个人玩游戏,规则是A先走然后B走,附加条件是走的第i步的那条边的权值要大于等于上一步边的权值,然后输出A,B所有起点的共n*n种情况的胜负。
我的做法是从末端考虑,相当于进行拓扑,把所有出度为0的点放入到一个own已有队列中,每当有一个新的出度为0的点进入时,就把这个点和其它所有点所组成的情况进行dp,就是枚举这个点的
下一步情况,然后再枚举另一个点的下一步情况,相当于两个for循环,同时为应对附加条件要对走的起点边进行记录,所以开三维dp,因为是倒着向前推得,所以记录的是起点边,更新的时候就
把小于等于起点边的同时也更新掉,第三位的意思是小于等于即可利用这个。。。 然后别人的做法是直接从头往后走就ok了,然后记忆化记忆一下,比我的优美多了。。。
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=;
int dp[N][N][],n,ru[N],m,q[N],own[N];
vector<int>F[N];
vector<pair<int,int> >Z[N];
int main(){
scanf("%d%d",&n,&m);
int x,y,l=,r=,tot=;char z;
for(int i=;i<=m;++i) {
scanf("%d %d %c",&x,&y,&z);
Z[x].push_back(make_pair(y,(int)z));
F[y].push_back(x);
++ru[x];
}
for(int i=;i<=n;++i) if(!ru[i]) q[r++]=i;
while(l<r) {
int u=q[l++];
for(int i=;i<tot;++i) for(int j=;j<(int)Z[u].size();++j)
{
bool ok=;
for(int k=;k<(int)Z[own[i]].size();++k) if(Z[own[i]][k].second>=Z[u][j].second) ok&=dp[Z[u][j].first][Z[own[i]][k].first][Z[own[i]][k].second];
dp[u][own[i]][Z[u][j].second]|=ok;
if(ok) for(int l=(int)'a';l<=Z[u][j].second;++l) dp[u][own[i]][l]=;
}
for(int i=;i<tot;++i) for(int j=;j<(int)Z[own[i]].size();++j)
{
bool ok=;
for(int k=;k<(int)Z[u].size();++k) if(Z[own[i]][j].second<=Z[u][k].second) ok&=dp[Z[own[i]][j].first][Z[u][k].first][Z[u][k].second];
dp[own[i]][u][Z[own[i]][j].second]|=ok;
if(ok) for(int l=(int)'a';l<=Z[own[i]][j].second;++l) dp[own[i]][u][l]=;
}
for(int i=;i<(int)F[u].size();++i) {
int v=F[u][i];
--ru[v];
if(ru[v]==) q[r++]=v;
}
own[tot++]=u;
}
for(int i=;i<=n;++i) {
for(int j=;j<=n;++j) if(dp[i][j][(int)'a']) putchar('A');else putchar('B');
puts("");
}
}
http://blog.csdn.net/winter2121/article/details/79203764//别人的解法
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,x,y,dp[][][],dis[][];
int DP(int s,int t,int w){
if(dp[s][t][w-'a']>=) return dp[s][t][w-'a'];
for(int i=;i<=n;++i) if(dis[s][i]>=w&&(DP(t,i,dis[s][i])==)) return dp[s][t][w-'a']=;
return dp[s][t][w-'a']=;
}
int main(){
char z;
scanf("%d%d",&n,&m);
for(int i=;i<=m;++i) {
scanf("%d %d %c",&x,&y,&z);
dis[x][y]=z;
}
memset(dp,-,sizeof(dp));
for(int i=;i<=n;++i) for(int j=;j<=n;++j) DP(i,j,'a');
for(int i=;i<=n;++i) {
for(int j=;j<=n;++j) printf("%c",dp[i][j][]?'A':'B');
puts("");
}
}
Here's the graph in the first sample test case:

Here's the graph in the second sample test case:

CF #459 D. MADMAX的更多相关文章
- Codeforces Round #459 (Div. 2) D. MADMAX DFS+博弈
D. MADMAX time limit per test 1 second memory limit per test 256 megabytes input standard input outp ...
- Codeforces Round #459 (Div. 2):D. MADMAX(记忆化搜索+博弈论)
D. MADMAX time limit per test1 second memory limit per test256 megabytes Problem Description As we a ...
- CF Round #459
好菜啊 第一场cf就菜成这样...mdzz 可能是我把题看的太简单了吧... T1AC T2AC T3WA T4看错题 T5不会写 T3想的是栈+暴力 正解: 对于一个pretty串的任意一个位置, ...
- Codeforces Round #459 (Div. 2):D. MADMAX(记忆化搜索+博弈论)
题意 在一个有向无环图上,两个人分别从一个点出发,两人轮流从当前点沿着某条边移动,要求经过的边权不小于上一轮对方经过的边权(ASCII码),如果一方不能移动,则判负.两人都采取最优策略,求两人分别从每 ...
- 【Codeforces Round #459 (Div. 2) D】MADMAX
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] f[x][y][z][2] 表示第一个人到了点x,第二个人到了点y,当前轮的字母(1..26),当前轮到谁走的情况下,谁赢. 写个记 ...
- Codeforces Round #459 (Div. 2)
A. Eleven time limit per test 1 second memory limit per test 256 megabytes input standard input outp ...
- codeforces 459 A. Pashmak and Garden 解题报告
题目链接:http://codeforces.com/problemset/problem/459/A 题目意思:给出两个点的坐标你,问能否判断是一个正方形,能则输出剩下两点的坐标,不能就输出 -1. ...
- ORA-00494: enqueue [CF] held for too long (more than 900 seconds) by 'inst 1, osid 5166'
凌晨收到同事电话,反馈应用程序访问Oracle数据库时报错,当时现场现象确认: 1. 应用程序访问不了数据库,使用SQL Developer测试发现访问不了数据库.报ORA-12570 TNS:pac ...
- cf之路,1,Codeforces Round #345 (Div. 2)
cf之路,1,Codeforces Round #345 (Div. 2) ps:昨天第一次参加cf比赛,比赛之前为了熟悉下cf比赛题目的难度.所以做了round#345连试试水的深浅..... ...
随机推荐
- Linux系统管理第四次作业 磁盘管理 文件系统
1.为主机新增两块30GB的SCSI硬盘 2.划分3个主分区,各5GB,剩余空间作为扩展分区 [root@localhost ~]# fdisk /dev/sdb 欢迎使用 fdisk (util-l ...
- [软件共享]将数据库中的数据导出为SQL脚本
可以直接将数据库中的数据导出为脚本,并可以自己设置过滤条件.使用方法很简单,不在多说了.下面是软件截图.123 下载:http://files.cnblogs.com/pw/mssql2.rar
- nginx 反向代理转发导致css,js,图片失效
为什么80%的码农都做不了架构师?>>> 需要添加以下配置 location ~ .*\.(gif|jpg|jpeg|png|bmp|swf)$ { proxy_pass htt ...
- PHP版DES算法加密数据(3DES)另附openssl_encrypt版本
PHP版DES算法加密数据(3DES) 可与java的DES(DESede/CBC/PKCS5Padding)加密方式兼容 <?php /** * Created by PhpStorm. * ...
- 图论--2-SAT--HDOJ/HDU 1824 Let's go home
Problem Description 小时候,乡愁是一枚小小的邮票,我在这头,母亲在那头. -- 余光中 集训是辛苦的,道路是坎坷的,休息还是必须的. ...
- python(logging 模块)
1.logging 模块的日志级别 DEBUG:最详细的日志信息,典型应用场景是 问题诊断 INFO:信息详细程度仅次于DEBUG,通常只记录关键节点信息,用于确认一切都是按照我们预期的那样进行工作 ...
- bat 命令
1.强制杀死进程 /F force 强制性/IM image + 进程名 TASKKILL /F /IM python.exe
- Jmeter简单压测之服务器监控
此篇为最近工作需要到内容,故现在做一个总结. 最近家里电脑坏了,等待会公司空闲在编写. 文章构思中,敬请期待.......
- 现代企业要求上什么样的MES(四)
一个制造企业要想盈利,在生产方面要做的无非是提高资源利用效率和缩短生产通过时间(生产周期),而实现这俩步骤需要生产状况的在线透明及避免薄弱环节的分析数据,由此达到改善生产状态的目的.在erp系统中,通 ...
- Git 向远端仓库推文件
第一次推送: 1.git init (创建本地仓库) 2. git remote add origin <远端仓库地址> (与远端仓库建立链接) 3.git checkout -b < ...