题意:一个游戏有n个数,每次只能去序号最小的堆中的数,每次取任意值,两人轮流取数,最后一个取完时游戏结束,最后一个取数的为胜者。求是否先手必胜。
链接:http://acm.hdu.edu.cn/showproblem.php?pid=4994
思路:Nim博弈问题,先手必胜,遇到1时,必胜点转化为必败点。
注意点:可能有所有值都为1的情况。
以下为AC代码:
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
12479005 | 2014-12-12 18:47:31 | Accepted | 4994 | 234MS | 1220K | 1616 B | G++ | luminous11 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
int main()
{
int t;
long long num[1005];
cin >> t;
while ( t -- )
{
int n;
cin >> n;
bool w = false;
bool flag = 0;
int cnt = 0;
memset ( num, 0, sizeof ( num ) );
for ( int i = 0; i < n; i ++ )
{
cin >> num[i];
if ( num[i] > 1 )
{
w = true;
}
if ( ! w )
{
cnt ++;
}
}
if ( w )
{
if ( ! ( cnt & 1 ) )
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
else
{
if ( ( cnt & 1 ) )
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
}
return 0;
}