QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#135154 | #6642. (1, 2) Nim | PanC_ake# | WA | 5ms | 3476kb | C++20 | 814b | 2023-08-05 12:14:53 | 2023-08-05 12:14:54 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int maxn = 200010;
int a[maxn];
void solve() {
int n;
cin >> n;
int cnt2 = 0;
for (int i = 1; i <= n; i++) cin >> a[i], cnt2 += (a[i] != 1);
if (n == 1) {
cout << "Sprague" << '\n';
return;
} else if (n == 2) {
cout << "Grundy" << '\n';
return;
}
if (cnt2 == 0) {
if (n % 3 == 1) {
cout << "Sprague" << '\n';
} else {
cout << "Grundy" << '\n';
}
} else if (cnt2 == 1) {
cout << "Sprague" << '\n';
} else {
cout << "Grundy" << '\n';
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t = 1;
cin >> t;
while (t--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3476kb
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: 5ms
memory: 3464kb
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 Sprague Grundy Sprague Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grun...
result:
wrong answer 24th lines differ - expected: 'Grundy', found: 'Sprague'