2.20（博弈论入门）

Calendar Game
Adam and Eve enter this year’s ACM International Collegiate Programming Contest. Last night, they played the Calendar Game, in celebration of this contest. This game consists of the dates from January 1, 1900 to November 4, 2001, the contest day. The game starts by randomly choosing a date from this interval. Then, the players, Adam and Eve, make moves in their turn with Adam moving first: Adam, Eve, Adam, Eve, etc. There is only one rule for moves and it is simple: from a current date, a player in his/her turn can move either to the next calendar date or the same day of the next month. When the next month does not have the same day, the player moves only to the next calendar date. For example, from December 19, 1924, you can move either to December 20, 1924, the next calendar date, or January 19, 1925, the same day of the next month. From January 31 2001, however, you can move only to February 1, 2001, because February 31, 2001 is invalid.

A player wins the game when he/she exactly reaches the date of November 4, 2001. If a player moves to a date after November 4, 2001, he/she looses the game.

Write a program that decides whether, given an initial date, Adam, the first mover, has a winning strategy.

For this game, you need to identify leap years, where February has 29 days. In the Gregorian calendar, leap years occur in years exactly divisible by four. So, 1993, 1994, and 1995 are not leap years, while 1992 and 1996 are leap years. Additionally, the years ending with 00 are leap years only if they are divisible by 400. So, 1700, 1800, 1900, 2100, and 2200 are not leap years, while 1600, 2000, and 2400 are leap years.

Input
The input consists of T test cases. The number of test cases (T) is given in the first line of the input. Each test case is written in a line and corresponds to an initial date. The three integers in a line, YYYY MM DD, represent the date of the DD-th day of MM-th month in the year of YYYY. Remember that initial dates are randomly chosen from the interval between January 1, 1900 and November 4, 2001.

Output
Print exactly one line for each test case. The line should contain the answer “YES” or “NO” to the question of whether Adam has a winning strategy against Eve. Since we have T test cases, your program should output totally T lines of “YES” or “NO”.

Sample Input

3
2001 11 3
2001 11 2
2001 10 3

Sample Output

YES
NO
NO

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uii;
typedef pair<int, ll> pii;
template<typename T>
inline void rd(T& x)
{
	int tmp = 1; char c = getchar(); x = 0;
	while (c > '9' || c < '0') { if (c == '-')tmp = -1; c = getchar(); }
	while (c >= '0' && c <= '9') { x = x * 10 + c - '0'; c = getchar(); }
	x *= tmp;
}
const int N = 2e5 + 10;
const int M = 1e7 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int n, m, k;
int sg[2005][15][35] = { 0 };
int day[13] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };
inline bool isLeap(int y) {
	return (y % 4 == 0 && y % 100 != 0) || (y % 400 == 0);
}
int dfs(int y, int m, int d) {
	if (sg[y][m][d]) return sg[y][m][d];
	if (y > 2001) return 1;
	if (y == 2001 && m > 11) return 1;
	if (y == 2001 && m == 11 && d > 4) return 1;
	if (m == 2) {
		if (isLeap(y) && d == 29 || !isLeap(y) && d == 28) {
			if (dfs(y, m + 1, 1) == -1) return sg[y][m][d] = 1;
		}
		else {
			if (dfs(y, m, d + 1) == -1) return sg[y][m][d] = 1;
		}
	}
	else if (d == day[m]) {
		if (m < 12 && dfs(y, m + 1, 1) == -1) return sg[y][m][d] = 1;
		else if (m == 12 && dfs(y + 1, 1, 1) == -1) return sg[y][m][d] = 1;
	}
	else {
		if (dfs(y, m, d + 1) == -1) return sg[y][m][d] = 1;
	}

	if (m != 12) {
		if (day[m + 1] >= (d + isLeap(y) && m == 2)) {
			if (dfs(y, m + 1, d) == -1) return sg[y][m][d] = 1;
		}
	}
	else {
		if (dfs(y + 1, 1, d) == -1) return sg[y][m][d] = 1;
	}
	return sg[y][m][d] = -1;
}
int main() {
#ifdef _DEBUG
	FILE* _INPUT = freopen("input.txt", "r", stdin);
#endif
	int cas = 0, T = 0;
	rd(T);
	sg[2001][11][4] = -1;
	while (T--) {
		int y, m, d; rd(y), rd(m), rd(d);
		if (dfs(y, m, d) == 1) puts("YES");
		else puts("NO");
	}
	return 0;
}