Codeforces Round #459 (Div. 2) D.MADMAX(记忆化搜索)

Description

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

题目大意

一个有向无环图，含有n个节点，每条边都有一个权值用小写字母表示.现在Max 和Lucas 在玩一个游戏，轮流走.Max先走，每次走的边的权值都要大于等于上一个人走的边的权值，谁先不能走了就输.题目要求输出Max 在i 点，Lucas在j 点游戏状态的赢家，Max赢为’A’，否则为’B’.

解题思路

记忆化搜索，dp[i][j][c]代表当前走的人在i 点，另一个人在j 点，上一轮的权值为c，dp[][][]=1代表此状态下当前玩家赢，dp[][][]=2代表当前玩家输，

代码实现

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IO ios::sync_with_stdio(false);\
cin.tie(0);\
cout.tie(0);
#define maxn 107
char maps[maxn][maxn];
int dp[maxn][maxn][37];
int m,n;
int dfs(int u,int v,int c)
{
    if(dp[u][v][c]!=-1) return dp[u][v][c];
    for(int i=1;i<=m;i++)
    {
        if(maps[u][i]-'a'>=c&&dfs(v,i,maps[u][i]-'a')==2)
            return dp[u][v][c]=1;
    }
    return dp[u][v][c]=2;
}
int main()
{
    IO;
    int u,v;
    char ch;
    cin>>m>>n;
    memset(dp,-1,sizeof(dp));
    for(int i=1;i<=n;i++)
    {
            cin>>u>>v>>ch;
            maps[u][v]=ch;
    }
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(dfs(i,j,0)==1) cout<<"A";
            else cout<<"B";
        }
        cout<<endl;
    }
    cout<<endl;
    return 0;
}