QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#579821#6642. (1, 2) NimMilanWA 7ms3776kbC++231.3kb2024-09-21 18:11:012024-09-21 18:11:01

Judging History

你现在查看的是最新测评结果

  • [2024-09-21 18:11:01]
  • 评测
  • 测评结果:WA
  • 用时:7ms
  • 内存:3776kb
  • [2024-09-21 18:11:01]
  • 提交

answer

    #include <bits/stdc++.h>
    #define MULTI int _; cin >> _; while(_--)
    #define fi first
    #define se second
    #define pb(a) push_back(a)
    #define rep(i, n) for(int i = 0; i < n; i++)
    #define reps(i, n, m) for(int i = n; i <= m; i++)
    #define repsv(i, n, m) for(int i = n; i >= m; i--)
    #define vsz(a) (int)(a.size())
    #define mp(a, b) make_pair(a, b)
    #define all(a) a.begin(), a.end()

    using namespace std;

    typedef pair<double, double> pdd;
    typedef pair<int, int> pii;
    typedef vector<bool> vb;
    typedef vector<int> vi;
    typedef long long int ll;
    typedef long double ld;
    typedef vector<ll> vll;

    #ifdef LOCAL
    #include "debugs.hpp"
    #else
    #define dbg(...) 0
    #endif

    void solve(){
        int n;
        cin >> n;
        vi a(n);
        rep(i, n) cin >> a[i];
        if(n%2 == 0){
            cout << "Grundy\n";
            return;
        }
        sort(all(a));
        if(n == 1){
            cout << "Sprague\n";
            return;
        }
        if(a[2] > 2 || a[3] > 1){
            cout << "Grundy\n";
        }
        else
            cout << "Sprague\n";
    }

    int main(){
        ios_base::sync_with_stdio(false);
        MULTI
        solve();
    }

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3776kb

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: 7ms
memory: 3656kb

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
Sprague
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Grundy
Sprague
Grundy
Grundy
Grundy
Grundy
Sprague
Grundy
Grundy
Sprague
Grundy
Grundy
Grundy
Sprague
Sprague
Grundy
Grundy
Grundy
Grundy
Sprague
Grundy
Grundy...

result:

wrong answer 5th lines differ - expected: 'Grundy', found: 'Sprague'