D. MADMAX
time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

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.

Input

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.

Output

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.

Examples
Input
4 4
1 2 b
1 3 a
2 4 c
3 4 b
Output
BAAA
ABAA
BBBA
BBBB
Input
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
Output
BABBB
BBBBB
AABBB
AAABA
AAAAB
题意:给你一个有向无环图,两个人玩游戏,规则是A先走然后B走,附加条件是走的第i步的那条边的权值要大于等于上一步边的权值,然后输出A,B所有起点的共n*n种情况的胜负。
我的做法是从末端考虑,相当于进行拓扑,把所有出度为0的点放入到一个own已有队列中,每当有一个新的出度为0的点进入时,就把这个点和其它所有点所组成的情况进行dp,就是枚举这个点的
下一步情况,然后再枚举另一个点的下一步情况,相当于两个for循环,同时为应对附加条件要对走的起点边进行记录,所以开三维dp,因为是倒着向前推得,所以记录的是起点边,更新的时候就
把小于等于起点边的同时也更新掉,第三位的意思是小于等于即可利用这个。。。 然后别人的做法是直接从头往后走就ok了,然后记忆化记忆一下,比我的优美多了。。。
Note
#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的更多相关文章

  1. 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 ...

  2. Codeforces Round #459 (Div. 2):D. MADMAX(记忆化搜索+博弈论)

    D. MADMAX time limit per test1 second memory limit per test256 megabytes Problem Description As we a ...

  3. CF Round #459

    好菜啊 第一场cf就菜成这样...mdzz 可能是我把题看的太简单了吧... T1AC T2AC T3WA T4看错题 T5不会写 T3想的是栈+暴力 正解:  对于一个pretty串的任意一个位置, ...

  4. Codeforces Round #459 (Div. 2):D. MADMAX(记忆化搜索+博弈论)

    题意 在一个有向无环图上,两个人分别从一个点出发,两人轮流从当前点沿着某条边移动,要求经过的边权不小于上一轮对方经过的边权(ASCII码),如果一方不能移动,则判负.两人都采取最优策略,求两人分别从每 ...

  5. 【Codeforces Round #459 (Div. 2) D】MADMAX

    [链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] f[x][y][z][2] 表示第一个人到了点x,第二个人到了点y,当前轮的字母(1..26),当前轮到谁走的情况下,谁赢. 写个记 ...

  6. Codeforces Round #459 (Div. 2)

    A. Eleven time limit per test 1 second memory limit per test 256 megabytes input standard input outp ...

  7. codeforces 459 A. Pashmak and Garden 解题报告

    题目链接:http://codeforces.com/problemset/problem/459/A 题目意思:给出两个点的坐标你,问能否判断是一个正方形,能则输出剩下两点的坐标,不能就输出 -1. ...

  8. 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 ...

  9. cf之路,1,Codeforces Round #345 (Div. 2)

     cf之路,1,Codeforces Round #345 (Div. 2) ps:昨天第一次参加cf比赛,比赛之前为了熟悉下cf比赛题目的难度.所以做了round#345连试试水的深浅.....   ...

随机推荐

  1. 阿里巴巴年薪800k大数据全栈工程师成长记

    大数据全栈工程师一词,最早出现于Facebook工程师Calos Bueno的一篇文章 - Full Stack (需fanqiang).他把全栈工程师定义为对性能影响有着深入理解的技术通才.自那以后 ...

  2. RedHat Enterprise Linux 5.8 升级openssl

    RedHat Enterprise Linux 5.8升级openssl,遇到以下问题,做下标记: 由于之前安装RedHat Enterprise Linux 5.8 时候只安装了服务器环境,没有安装 ...

  3. 疯子的算法总结14--ST算法(区间最值)

    借助倍增和动态规划可以实现O(1)的时间复杂度的查询 预处理: ①区间DP   转移方程  f[i][j] = min(MAX同理)(f[i][j - 1],f[i + ][j - 1])  f[i] ...

  4. 在Jetson TX2上安装caffe和PyCaffe

    caffe是Nvidia TensorRT最支持的深度学习框架,因此在Jetson TX2上安装caffe很有必要.顺便说一句,下面的安装是支持python3的. 先决条件 在Jetson TX2上完 ...

  5. 【Layui__监听button】在form中监听按钮事件

    1. 前言 在使用form表单的按钮时,点击按钮总是页面刷新,代码如下 <button class="layui-btn" lay-submit lay-filter=&qu ...

  6. 前端——Vue CLI 3.x搭建Vue项目

    一.Node安装 windows 1. Node.js (>=8.9, 推荐8.11.0+) Node官网下载 .msi 文件,按步骤下载安装即可. 安装完之后在cmd中输入 node -v,若 ...

  7. CTF-Pwn-[BJDCTF 2nd]diff

    CTF-Pwn-[BJDCTF 2nd]diff 博客说明 文章所涉及的资料来自互联网整理和个人总结,意在于个人学习和经验汇总,如有什么地方侵权,请联系本人删除,谢谢!本文仅用于学习与交流,不得用于非 ...

  8. Web概念

    目录 Web概念概述 Web概念概述 JavaWeb 使用 Java 语言开发基于互联网的项目 软件架构 C / S:Client / Server 客户端 / 服务器端 在用户本地有一个客户端程序, ...

  9. Vue + Element-ui实现后台管理系统(4)---封装一个ECharts组件的一点思路

    封装一个ECharts组件的一点思路 有关后台管理系统之前写过三遍博客,看这篇之前最好先看下这三篇博客.另外这里只展示关键部分代码,项目代码放在github上: mall-manage-system ...

  10. Day_12【集合】扩展案例3_产生10个长度为10,不能重复,由数字0-9,小写字母和大写字母组成的字符串

    分析以下需求,并用代码实现 1.产生10个1-20之间的随机数要求随机数不能重复 2.产生10个长度为10的不能重复的字符串(里面只能出现大写字母.小写字母.0-9的数字),并遍历打印输出 代码 pa ...