【POJ 1082】 Calendar Game

【题目链接】

http://poj.org/problem?id=1082

【算法】

对于每种状态，要么必胜，要么必败

记忆化搜索即可

【代码】

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>

using namespace std;

int newy,newm,newd,y,m,d,T;
int f[][][];
int day[] = {,,,,,,,,,,,,};

template <typename T> inline void read(T &x) {
    int f = ; x = ; char c = getchar();
    for (; !isdigit(c); c = getchar()) { if (c == '-') f = -; }
    for (; isdigit(c); c = getchar()) x = x *  + c - '';
    x *= f;
}

bool is_leap(int yy) {
    if (((yy %  == ) && (yy %  != )) || (yy %  == ))
        return true;
    else return false;
}

bool check(int yy,int mm,int dd) {
    if (is_leap(yy)) day[] = ;
    else day[] = ;
    if (dd > day[mm]) return false;
    if (yy > ) return false;
    if ((yy == ) && (mm > )) return false;
    if ((yy == ) && (mm == ) && (dd > )) return false;
    return true;
}

void next_day() {
    if (is_leap(newy)) day[] = ;
    else day[] = ;
    newd++;
    if (newd > day[newm]) { newd = ; newm++; }
    if (newm > ) { newm = ; newy++; }
}

void next_month() {
    newm++;
    if (newm > ) { newm = ; newy++; }
}

bool dfs(int yy,int mm,int dd) {
    if (f[yy][mm][dd] != -)
        return f[yy][mm][dd];
    f[yy][mm][dd] = ;
    newy = yy; newm = mm; newd = dd;
    next_day();
    if (check(newy,newm,newd)) {
        f[yy][mm][dd] |= (!dfs(newy,newm,newd));
        if (f[yy][mm][dd] == )
            return true;
    }
    newy = yy; newm = mm; newd = dd;
    next_month();
    if (check(newy,newm,newd))
        f[yy][mm][dd] |= (!dfs(newy,newm,newd));
    return f[yy][mm][dd];
}

int main() { 

    memset(f,,sizeof(f));
    f[][][] = ;
    read(T);

    while (T--) {
        read(y); read(m); read(d);
        puts((dfs(y,m,d))?("YES"):("NO"));
    }

    return ;

}