HDU 1079

题意略。

思路：dfs记忆化搜索即可。

#include<bits/stdc++.h>
using namespace std;

int sg[][][];
int month_len[][];

bool is_leap(int y){
    return (y %  || (y %  ==  && y %  != ));
}
int dfs(int y,int m,int d){
    if(sg[y][m][d] != -) return sg[y][m][d];
    if(y >  || (y ==  && m > ) ||
    (y ==  && m ==  && d > )) return ;
    bool signal = false;
    if(d <= month_len[is_leap(y)][m %  + ]) signal = true;
    int a = ,b = ;

    int ny1 = y,nm1 = m,nd1 = d,ny2 = y,nm2 = m,nd2 = d;
    if(d < month_len[is_leap(y)][m]) nd1 = d + ;
    else if(m < ){
        nm1 += ;
        nd1 = ;
    }
    else{
        ny1 += ;
        nm1 = ;
        nd1 = ;
    }
    a = dfs(ny1,nm1,nd1);

    if(signal){
        if(m < ){
            nm2 += ;
        }
        else{
            ny2 += ;
            nm2 = ;
        }
        b = dfs(ny2,nm2,nd2);
    }

    return sg[y][m][d] = !(a & b);
}

int main(){
    month_len[][] = month_len[][] = ;
    month_len[][] = ,month_len[][] = ;
    month_len[][] = month_len[][] = ;
    month_len[][] = month_len[][] = ;
    month_len[][] = month_len[][] = ;
    month_len[][] = month_len[][] = ;
    month_len[][] = month_len[][] = ;
    month_len[][] = month_len[][] = ;
    month_len[][] = month_len[][] = ;
    month_len[][] = month_len[][] = ;
    month_len[][] = month_len[][] = ;
    month_len[][] = month_len[][] = ;
    memset(sg,-,sizeof(sg));
    sg[][][] = ;
    int T;
    scanf("%d",&T);
    while(T--){
        int y,m,d;
        scanf("%d%d%d",&y,&m,&d);
        int ans = dfs(y,m,d);
        printf("%s\n",ans ? "YES" : "NO");
    }
    return ;
}