QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#658780 | #9481. Min Nim | ucup-team3659# | WA | 0ms | 3804kb | C++20 | 720b | 2024-10-19 17:36:09 | 2024-10-19 17:36:16 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
void test()
{
int n;
map<int,int> mp;
cin>>n;
if(n&1)
{
cout<<"First\n";
return;
}
for(int i=1;i<=n;i++)
{
int x;
cin>>x;
mp[x]++;
}
int cnt=0;
mp[1000000007]++;
for(pair<int,int> p:mp)
{
if(p.second&1)
{
if(cnt&1)
cout<<"Second\n";
else
cout<<"First\n";
break;
}
else
cnt++;
}
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
for(int i=1;i<=t;i++)
test();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3804kb
input:
2 3 3 1 4 8 3 1 4 1 5 9 2 6
output:
First First
result:
wrong answer 2nd words differ - expected: 'Second', found: 'First'