QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#105209	#4797. Xormites	Determinant	WA	2ms	3632kb	C++14	526b	2023-05-13 16:47:31	2023-05-13 16:47:34

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-05-13 16:47:34]
评测

测评结果：WA
用时：2ms
内存：3632kb

查看

[2023-05-13 16:47:31]
提交

answer

#include<bits/stdc++.h>
using namespace std;int n,s,a[50007];
int chk(int l,int r){
	s=0;for(int i=l;i<=r;++i)s+=a[i];if(s&2)return 0;
	while(a[l]==a[r]&&l<r)l++,r--;for(int i=l;i<=r;i+=2)if(a[i]!=a[i+1])return 0;
	return 1;
}
void sol(){
	s=0;scanf("%d",&n);for(int i=1;i<=n;++i)scanf("%d",&a[i]),s^=a[i];
	if(!s){puts("Draw");return;}s=__lg(s&(-s));
	for(int i=1;i<=n;++i)a[i]=(a[i]>>s)&1;
	puts(!(n&1)||(a[1]&&chk(2,n))||(a[n]&&chk(1,n-1))?"First":"Second");
}
int main(){int t;scanf("%d",&t);while(t--)sol();}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 2ms

memory: 3416kb

input:

output:

Draw
First
Second

result:

ok 3 lines

Test #2:

score: 0

Accepted

time: 2ms

memory: 3444kb

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: 0

Accepted

time: 1ms

memory: 3476kb

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:

Second
First
Second
Second
First
First
First
Second
First
First
First
Second

result:

ok 12 lines

Test #4:

score: 0

Accepted

time: 2ms

memory: 3460kb

input:

12
9
1 5 7 1 4 7 7 3 1
9
2 7 3 2 1 5 1 6 6
10
3 4 6 6 4 5 4 7 5 4
9
2 3 1 5 7 3 6 3 3
10
1 2 5 2 2 6 3 7 7 3
9
2 3 1 1 5 5 2 6 2
9
6 6 4 1 5 4 6 1 2
10
2 6 2 3 6 7 7 4 2 5
10
3 4 5 5 2 1 1 2 4 1
9
7 5 5 2 3 7 7 1 1
10
7 1 3 7 3 4 4 1 7 5
10
2 6 5 7 3 6 1 3 3 3

output:

Second
Second
First
Second
Draw
Second
Second
Draw
First
First
First
First

result:

ok 12 lines

Test #5:

score: 0

Accepted

time: 2ms

memory: 3632kb

input:

12
10
1 1 1 2 1 2 1 1 1 2
10
1 1 1 2 1 1 2 1 1 2
10
1 2 2 1 2 1 1 1 2 1
10
2 2 2 1 2 2 1 2 2 2
10
1 1 1 2 1 1 2 2 2 1
10
2 2 1 2 1 1 2 1 1 2
10
2 2 1 2 1 1 1 1 1 2
10
2 2 1 2 1 1 1 2 2 2
10
2 1 1 1 1 1 2 1 2 2
10
2 1 2 1 2 1 1 2 2 2
10
2 1 1 1 1 1 2 1 1 1
15
913276852 922705701 913276910 914316078 2...

output:

First
First
Draw
Draw
Draw
First
Draw
Draw
Draw
Draw
Draw
Second

result:

ok 12 lines

Test #6:

score: 0

Accepted

time: 2ms

memory: 3572kb

input:

12
10
2 2 1 1 1 2 2 2 1 2
10
1 1 1 2 1 2 2 1 1 2
10
2 1 2 1 2 2 1 2 2 2
10
1 1 2 1 2 1 2 1 1 2
10
2 2 1 2 1 2 2 1 1 2
10
2 2 1 1 1 2 1 1 1 1
10
1 2 1 2 1 1 1 2 1 2
10
2 1 1 1 2 2 2 1 1 1
10
1 1 1 2 1 2 2 2 2 1
10
1 2 1 1 1 2 1 2 1 1
10
2 2 1 2 1 2 2 1 1 2
10
1 1 2 2 2 2 2 1 2 1

output:

Draw
Draw
First
Draw
Draw
First
Draw
Draw
First
First
Draw
Draw

result:

ok 12 lines

Test #7:

score: 0

Accepted

time: 1ms

memory: 3468kb

input:

12
10
2 1 1 1 1 2 2 1 2 2
10
2 1 2 2 2 1 1 2 2 1
10
1 1 1 2 2 2 2 1 1 1
10
1 1 1 2 1 1 2 2 1 1
10
1 2 2 2 2 1 2 2 2 2
10
2 1 1 2 2 2 1 1 2 2
10
1 2 2 2 1 1 1 2 1 1
10
1 1 2 1 1 1 1 1 1 2
10
2 1 1 1 1 1 1 1 2 1
10
2 2 1 2 2 1 1 1 1 1
10
1 2 2 1 1 1 2 1 1 2
10
2 1 1 2 1 2 1 2 1 1

output:

First
Draw
Draw
First
Draw
Draw
Draw
Draw
Draw
Draw
Draw
Draw

result:

ok 12 lines

Test #8:

score: 0

Accepted

time: 2ms

memory: 3620kb

input:

12
10
1 2 1 1 1 2 1 2 2 2
10
2 2 2 1 2 1 1 2 2 2
10
2 1 1 2 1 2 2 1 1 2
10
1 1 1 2 1 1 1 1 1 1
10
2 2 2 1 2 2 1 2 2 2
10
1 1 1 2 2 1 2 2 1 2
10
2 2 1 2 1 1 1 2 2 1
10
2 2 1 2 1 2 1 1 1 1
10
2 2 2 1 1 2 1 1 2 1
10
2 2 1 2 1 2 1 2 1 2
10
1 1 1 2 2 1 1 2 1 1
10
2 2 2 1 1 2 1 1 1 2

output:

First
First
First
First
Draw
First
First
Draw
First
Draw
First
First

result:

ok 12 lines

Test #9:

score: 0

Accepted

time: 2ms

memory: 3632kb

input:

12
10
1 2 2 1 2 1 1 1 1 2
10
1 2 2 2 1 1 1 1 2 2
10
2 2 1 2 1 1 2 2 2 1
10
2 1 1 2 1 1 2 1 2 1
10
1 1 1 1 1 1 2 1 1 1
10
2 2 2 2 2 2 2 1 2 1
10
2 1 2 2 1 2 2 2 1 2
10
2 2 2 1 1 2 1 2 1 1
10
2 1 1 1 1 2 1 1 1 1
10
1 1 1 2 2 1 2 1 1 1
10
2 1 1 2 2 1 1 2 1 1
10
2 2 2 2 1 2 1 1 2 1

output:

Draw
First
Draw
Draw
First
Draw
First
First
Draw
First
Draw
Draw

result:

ok 12 lines

Test #10:

score: 0

Accepted

time: 2ms

memory: 3472kb

input:

12
10
2 1 1 1 1 1 2 1 1 1
10
1 1 1 2 1 1 2 2 1 1
10
1 1 1 1 2 2 2 1 1 1
10
1 2 1 1 1 2 1 1 2 1
10
1 2 2 2 2 2 2 2 2 1
10
1 1 1 2 1 2 1 2 2 2
10
1 2 1 2 2 1 1 1 2 2
10
2 2 1 2 1 2 2 1 2 1
10
1 1 1 2 2 2 1 1 2 1
10
2 1 1 1 1 2 1 2 1 1
10
1 2 2 1 2 2 1 1 2 1
10
1 1 1 1 1 2 2 2 1 2

output:

Draw
First
First
First
Draw
First
First
Draw
Draw
First
First
Draw

result:

ok 12 lines

Test #11:

score: 0

Accepted

time: 1ms

memory: 3336kb

input:

12
10
3 3 1 2 3 2 3 1 3 3
10
1 1 1 2 1 3 3 3 3 2
10
2 2 2 3 2 2 2 3 1 3
10
3 1 2 3 2 3 3 2 1 3
10
2 3 3 3 3 3 3 1 1 1
10
1 2 1 1 3 3 2 3 3 3
10
3 3 1 2 3 3 1 1 2 2
10
1 2 3 3 1 2 1 1 1 1
10
2 1 1 1 2 1 2 3 1 1
10
1 3 2 2 2 1 1 2 2 3
10
3 1 1 3 1 2 1 3 2 3
10
3 2 1 1 2 1 3 1 3 1

output:

Draw
Draw
First
First
First
First
First
Draw
First
First
Draw
First

result:

ok 12 lines

Test #12:

score: 0

Accepted

time: 2ms

memory: 3528kb

input:

12
10
3 3 1 2 1 2 1 1 3 2
10
2 1 1 2 1 1 3 2 3 3
10
1 1 2 3 3 3 2 2 3 3
10
2 3 2 3 1 2 1 2 1 3
10
2 3 2 2 1 1 2 2 2 3
10
1 2 2 3 3 3 1 2 2 1
10
2 3 3 1 1 1 3 1 2 1
10
2 2 3 2 2 1 1 2 2 1
10
3 2 2 1 1 1 1 1 3 1
10
1 3 1 2 2 2 1 1 1 3
10
3 2 1 1 3 3 1 1 3 1
10
3 2 3 1 1 3 1 1 1 2

output:

First
First
First
First
Draw
First
First
First
Draw
First
First
First

result:

ok 12 lines

Test #13:

score: 0

Accepted

time: 1ms

memory: 3564kb

input:

12
10
3 2 3 2 3 3 3 3 1 3
10
2 3 3 3 1 2 3 2 1 2
10
3 3 3 2 1 1 1 3 1 3
10
3 2 2 3 1 2 1 3 3 2
10
3 2 3 3 2 2 1 2 3 2
10
1 3 2 2 3 1 3 3 2 2
10
1 3 2 3 2 3 3 1 3 2
10
2 2 3 3 3 2 3 1 2 3
10
2 3 3 3 1 2 2 1 3 2
10
2 2 1 2 1 1 2 2 1 2
10
2 1 1 3 2 2 2 3 3 3
10
2 2 3 2 2 1 1 1 1 1

output:

First
Draw
First
Draw
First
Draw
First
First
Draw
Draw
Draw
First

result:

ok 12 lines

Test #14:

score: -100

Wrong Answer

time: 2ms

memory: 3568kb

input:

12
9
1 3 2 1 1 2 2 1 3
9
1 1 1 3 2 2 2 1 2
9
1 3 1 3 1 2 2 1 2
9
3 3 3 1 1 1 2 3 2
9
2 1 2 1 2 1 1 3 1
9
1 2 2 1 2 1 3 3 2
9
2 2 3 2 2 3 2 3 1
9
2 2 1 3 1 1 1 3 3
9
2 3 3 1 3 3 3 1 2
9
1 2 2 1 1 1 1 3 3
9
2 1 1 2 3 2 3 2 3
9
2 1 3 2 1 2 1 1 2

output:

First
Second
Second
Second
Draw
Second
Draw
Second
Second
Second
Second
Second

result:

wrong answer 2nd lines differ - expected: 'First', found: 'Second'