CodeForces - 918D MADMAX (DP 记忆化搜索)

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 vu and a lowercase English letter c, meaning there's an edge from vto u written c on it (1 ≤ v, u ≤ nv ≠ 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:



题意:给定两个人的起始位置,每人走一步,直到不能走,问最后谁赢。每个人走的必须比另一个人大。

解题思路:很容易想到深搜,深搜的过程可以记忆化一下,不然会超时。用dp[i][j][last]代表,A在i,B在j,A走,A选择走的路的大小为last的胜者是谁。1为胜者为A,2为胜者为B。这样子记忆化搜索即可。


#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <memory.h>

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)
        {
            //注意,这里的B为i,因为要交替的走
            int win=dfs(v,i,G[u][i]-'a');
            if(win==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;

}














相关推荐
©️2020 CSDN 皮肤主题: 点我我会动 设计师:白松林 返回首页