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

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 vto 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

Note

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

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

题意：两个人在DAG上玩游戏，每个人可以沿着边上走，每条边上有一个字母，每个人只能走的边上的字母必须大于等于上一个人走的边的字母

求两个人起点所有情况的胜负情况。

思路：

设(bool) dp u v k 表示一个人在u 另一个人在v 上一条边是k的胜负值，则若u走到i节点，而dp v i edge(u->i)为0 则dp u v k为1，然后在图上转移。

代码：

 //#include "bits/stdc++.h"
 #include "cstdio"
 #include "map"
 #include "set"
 #include "cmath"
 #include "queue"
 #include "vector"
 #include "string"
 #include "cstring"
 #include "time.h"
 #include "iostream"
 #include "stdlib.h"
 #include "algorithm"
 #define db double
 #define ll long long
 //#define vec vector<ll>
 #define Mt  vector<vec>
 #define ci(x) scanf("%d",&x)
 #define cd(x) scanf("%lf",&x)
 #define cl(x) scanf("%lld",&x)
 #define pi(x) printf("%d\n",x)
 #define pd(x) printf("%f\n",x)
 #define pl(x) printf("%lld\n",x)
 #define rep(i, x, y) for(int i=x;i<=y;i++)
 const int N   = 1e6 + ;
 const int mod = 1e9 + ;
 const int MOD = mod - ;
 const db  eps = 1e-;
 const db  PI  = acos(-1.0);
 using namespace std;
 int ans[][][];
 int mp[][],n,m;
 bool dfs(int u,int v,int x)
 {
     if(ans[u][v][x]) return ans[u][v][x];
     for(int i=;i<=n;i++){
         if(x>mp[u][i]) continue;
         if(!dfs(v,i,mp[u][i])) return ans[u][v][x]=;//(v,i,mp[u][i]) lost =>(u,v,x) win!
     }
     return ans[u][v][x]=;//it can't win anyway
 }
 int main()
 {
     ci(n),ci(m);
     memset(mp,-, sizeof(mp));
     for(int i=;i<m;i++)
     {
         int x,y;
         char s[];
         ci(x),ci(y);
         scanf("%s",s);
         mp[x][y]=s[]-'a';
     }
     for(int i=;i<=n;i++){
         for(int j=;j<=n;j++){
             if(dfs(i,j,)==) printf("A");
             else printf("B");
         }
         puts("");
     }
     return ;
 }