记忆化搜索（游戏NOIP17提高模拟训练11）

#include<bits/stdc++.h>
using namespace std;
 
int Map[2000][2000],hang[2000][2000],lie[2000][2000];
bool book [2000][2000][2];
bool dp[2000][2000][2];
int n;
 
bool dfs(int i,int j,bool point)
{
    if(i==0||j==0) return 0;
    if(book[i][j][point]) return dp[i][j][point];
    if(hang[i][j]%2==0) dp[i][j][point]=!dfs(i-1,j,point^1);
    if(lie[i][j]%2==0)
    {
        if(!dfs(i,j-1,point^1)||dp[i][j][point])
            dp[i][j][point]=1   ;
        else dp[i][j][point]=0;
    }
    book[i][j][point]=1;
    return dp[i][j][point];
}
 
 
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        memset(Map,0,sizeof(Map));memset(lie,0,sizeof(lie));memset(dp,0,sizeof(dp));memset(hang,0,sizeof(hang));
        memset(book,0,sizeof(book));
        cin>>n;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
            {
                cin>>Map[i][j];
                hang[i][j]=hang[i][j-1]+Map[i][j];
            }
        for(int j=1;j<=n;j++)
            for(int i=1;i<=n;i++)
                lie[i][j]=lie[i-1][j]+Map[i][j];
         
        if(dfs(n,n,0))cout<<"W\n";
        else cout<<"L\n";
    } 
    return 0;
}