QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#68489 | #4797. Xormites | A_zjzj | WA | 2ms | 3632kb | C++14 | 816b | 2022-12-16 20:49:10 | 2022-12-16 20:49:11 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;using ll=long long;const int N=5e4+10;
int T,n,s,a[N],pre[N],suf[N];char buf[3][10]={"Draw","First","Second"};
int get(){
s=0;scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]),s^=a[i];
if(!s)return 0;if(!(n&1))return 1;for(int i=__lg(s);~i;i--)if(s>>i&1){
if(n==1)return a[1]?1:2;
for(int j=1;j<=n;j++)a[j]=a[j]>>i&1;
pre[1]=a[1];for(int j=3;j<=n;j+=2)pre[j]=pre[j-2]^a[j];
suf[n]=a[n];for(int j=n-2;j>=1;j-=2)suf[j]=suf[j+2]^a[j];
for(int j=1;j+2<=n;j+=2){
int x=(j>1?pre[j-2]:0)^(j+4<=n?suf[j+4]:0);
if(a[j]!=a[j+1]&&a[j+1]!=a[j+2])continue;
if(a[j]==a[j+1]&&a[j+1]==a[j+2]){
if(x)return 1;
}
else if(x^1)return 1;
}
return 2;
}return 0;
}
int main(){
for(scanf("%d",&T);T--;)puts(buf[get()]);return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3500kb
input:
3 2 3 3 2 3 5 3 4 4 4
output:
Draw First Second
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 2ms
memory: 3632kb
input:
12 10 1 3 1 3 3 3 2 1 3 3 10 1 3 3 3 1 3 2 1 1 3 9 1 2 3 3 3 1 2 2 3 9 1 3 2 1 3 3 2 2 2 10 3 2 2 2 3 3 1 2 1 2 10 2 1 2 3 3 3 3 2 3 2 10 2 1 1 3 3 1 1 1 2 1 10 2 1 1 1 1 1 1 2 2 3 10 2 1 2 1 1 2 2 3 3 3 9 2 2 1 1 3 3 1 2 3 9 1 3 3 2 2 2 2 3 2 10 1 1 1 1 1 2 2 2 1 2
output:
First First Second Second First First Draw First First Draw Draw Draw
result:
ok 12 lines
Test #3:
score: -100
Wrong Answer
time: 2ms
memory: 3428kb
input:
12 9 3 4 1 5 2 1 5 3 1 10 6 2 4 5 4 2 5 7 5 6 9 5 3 2 1 2 4 4 1 4 9 5 7 6 2 7 2 5 7 4 10 7 5 1 6 7 1 5 1 4 5 10 4 2 6 2 7 2 2 2 3 5 10 7 3 4 7 4 4 2 3 7 5 9 3 3 7 1 6 3 7 2 3 10 5 3 7 7 2 6 4 7 3 1 10 1 7 4 2 4 2 6 6 4 4 10 4 1 3 4 4 4 5 4 1 7 9 4 3 4 7 1 6 2 2 5
output:
First First Second First First First First First First First First First
result:
wrong answer 1st lines differ - expected: 'Second', found: 'First'