QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#135151 | #6642. (1, 2) Nim | qwerty# | WA | 11ms | 4464kb | C++14 | 1.4kb | 2023-08-05 12:13:22 | 2023-08-05 12:13:23 |
Judging History
answer
#include <iostream>
#include <vector>
using namespace std;
string findWinner(int T, vector<int>& numPiles, vector<vector<int>>& piles) {
string winner = "";
for (int t = 0; t < T; t++) {
int N = numPiles[t];
vector<int>& A = piles[t];
int k = 0;
for (int i = 0; i < N; i++) {
if (A[i] > 1) {
k++;
}
}
if (k >= 2) {
winner += "Grundy\n";
continue;
}
if (k == 1) {
if (N % 3 != 2) {
winner += "Sprague\n";
} else {
winner += "Grundy\n";
}
} else {
if (N % 3 != 0) {
winner += "Sprague\n";
} else {
winner += "Grundy\n";
}
}
}
return winner;
}
int main() {
int T;
cin >> T;
vector<int> numPiles(T);
vector<vector<int>> piles(T, vector<int>());
for (int t = 0; t < T; t++) {
int N;
cin >> N;
numPiles[t] = N;
for (int i = 0; i < N; i++) {
int stones;
cin >> stones;
piles[t].push_back(stones);
}
}
string result = findWinner(T, numPiles, piles);
cout << result;
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3552kb
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: 11ms
memory: 4464kb
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 3434th lines differ - expected: 'Grundy', found: 'Sprague'