QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#134933 | #6642. (1, 2) Nim | Team_name# | WA | 0ms | 3640kb | C++20 | 813b | 2023-08-05 10:06:39 | 2023-08-05 10:06:50 |
Judging History
answer
#include <bits/stdc++.h>
#define _debugVar(x) { cerr << #x << " = " << x << endl; }
using namespace std;
using LL = long long;
const int N = 1e5+5;
int n;
int a[N];
bool solve()
{
if(n == 1) return false;
if(n == 2) return true;
int cnt = 0;
for(int i = 1; i <= n; i++)
if(a[i] > 1) cnt++;
if(cnt >= 2) return true;
else if(cnt == 0) {
if(n%3 == 0 || n%3 == 2)
return true;
else return false;
} else { // cnt == 1
if(n%3 == 0 || (n-1)%3 == 0) return true;
else return false;
}
}
int main()
{
// freopen("1.in", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T; cin >> T;
while(T--) {
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
if(solve()) puts("Grundy");
else puts("Sprague");
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
input:
3 2 1 2 1 5 4 1 7 2 9
output:
Grundy Sprague Grundy
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3640kb
input:
11337 9 4 1 2 3 2 4 3 2 3 10 1 7 1 5 1 2 2 2 1 3 9 1 3 7 3 3 1 1 3 2 12 1 1 2 4 1 2 2 4 2 2 1 4 15 1 3 4 3 1 2 1 4 1 1 1 1 1 1 1 8 3 3 2 2 3 9 1 2 10 2 2 2 2 1 5 1 2 7 2 10 2 2 2 3 2 2 3 5 2 2 7 2 2 6 2 2 3 5 10 1 1 1 3 1 1 1 5 1 1 8 2 2 2 2 5 2 10 1 5 3 10 1 3 1 8 3 4 2 2 1 1 11 1 6 6 4 8 2 4 2 10 ...
output:
Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Sprague Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grund...
result:
wrong answer 22nd lines differ - expected: 'Sprague', found: 'Grundy'