QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#174352#6642. (1, 2) NimPERAPRO#WA 21ms3544kbC++201.6kb2023-09-10 06:45:552023-09-10 06:45:56

Judging History

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

  • [2023-09-10 06:45:56]
  • 评测
  • 测评结果:WA
  • 用时:21ms
  • 内存:3544kb
  • [2023-09-10 06:45:55]
  • 提交

answer

/// Write by Daniel Perez .PERAPRO
#include<bits/stdc++.h>

using namespace std;
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

#define all(s) s.begin(), s.end()
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using vi=vector<int>;
using vl=vector<ll>;
using pii=pair<int,int>;
char el = '\n';
char esp = ' ';

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

template<typename T>
ostream& operator<<(ostream& os, const vector<T> &v){
    for(auto const &i: v){
        os<<i<<" ";
    }
    os<<'\n';
    return os;
}
string yes="YES";
string no="NO";

int main(){
	fast_io;
	/*
 	freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    */
    int tc ; 
    cin>>tc ; 
    while ( tc-- ){
        int n ; 
        cin>>n ; 
        int cont1 = 0 ; 
        int diff = 0 ; 
        for ( int i = 0 ; i < n ; i++ ){
            int c ; 
            cin>>c ; 
            if ( c == 1 ) cont1++ ; 
            else diff++ ; 
        }
        if ( diff >= 2 ) cout<<"Grundy"<<endl ;
        else{
            if ( diff == 1 ){
                if ( ( n - 1 ) % 3 == 0 ) cout <<"Sprague"<<endl ; 
                else if ( n % 3 == 0 ) cout<<"Sprague"<<endl ; 
                else cout<<"Grundy"<<endl ; 
            }
            else if ( n % 3 == 0 ) cout<<"Grundy"<<endl ;
            else cout<<"Sprague"<<endl ; 
        }
        
    }
    

    
}

/*

*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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'