QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#113871 | #6642. (1, 2) Nim | ITMO_pengzoo# | WA | 5ms | 3764kb | C++20 | 858b | 2023-06-19 21:36:01 | 2023-06-19 21:36:04 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int smax(int & x, int y) {
if (x < y) {
x = y;
return true;
}
return false;
}
int smin(int & x, int y) {
if (x > y) {
x = y;
return true;
}
return false;
}
void solve() {
int n;
cin >> n;
int ones = 0;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
if (x == 1) {
ones++;
}
}
int twos = n - ones;
if (twos <= 1 && (n % 3 == 1)) {
cout << "Sprague" << "\n";
} else {
cout << "Grundy\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
cin >> t;
while (t--) {
solve();
}
cerr << "Time " << clock() * 1. / CLOCKS_PER_SEC << "\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3748kb
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: 3764kb
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 Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grund...
result:
wrong answer 65th lines differ - expected: 'Sprague', found: 'Grundy'