MADMAX【记忆化搜索】

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

题目链接：点击打开链接

题意：

给你一个有向无环图，有n个节点，边上的权值为小写字母。max和lucas在玩一个游戏。轮流走，max先走。每次走的边的权值需要大于等于上一轮另一个人走的权值。谁先走不动了谁就输了。输出max在i，lucas在j（1<=i,j<=n）时的赢家，max赢输出A，lucas赢输出B。

思路：

可以用记忆化搜索。dp[i][j][k]表示现在轮到在i点的人走，另一个人在j点，上一轮的权值为k。1表示当前玩家赢，2表示当前玩家输。那么当下一个玩家没法走时，当前玩家赢，则记录状态并返回1。当当前玩家无论怎么走，下一个玩家都必赢时，记录状态返回2，即此玩家必输；当发现一条路下一个玩家必输时，则此玩家必赢。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<iostream>
#include<queue>
using namespace std;
int n,m;
char G[105][105];
int dp[105][105][30];
int dfs(int u,int v,int last)
{
    if(dp[u][v][last]) return dp[u][v][last];
    for(int i=1;i<=n;i++)
    {
        if(G[u][i]-'a'>=last && dfs(v,i,G[u][i]-'a')==2)
            return dp[u][v][G[u][i]-'a']=1;
    }
    return dp[u][v][last]=2;
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        int u,v;
        char c[2];
        memset(G,0,sizeof G);
        memset(dp,0,sizeof dp);
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%s",&u,&v,c);
            G[u][v]=c[0];
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(dfs(i,j,0)==1) printf("A");
                else printf("B");
            }
            printf("\n");
        }
    }
    return 0;
}