QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#132467	#6569. Splitting Pairs	Sorting^#	WA	1ms	3492kb	C++	376b	2023-07-29 23:58:20	2023-07-29 23:58:21

Judging History

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

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

[2023-07-29 23:58:21]
评测

测评结果：WA
用时：1ms
内存：3492kb

查看

[2023-07-29 23:58:20]
提交

answer

#include<bits/stdc++.h>
using namespace std;
int n;
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	int t;cin >> t;
	while(t--){
		cin >> n;
		int odd=0,even=0;
		for(int i=1; i<=n ;i++){
			long long x;cin >> x;
			if(x%2==1) odd++;
			else even++;
		}
		if(even==0) cout << "0\n";
		else if(n%2==1 && odd==0) cout << "0\n";
		else cout << "1\n";
	}
}

Source code, Language: C++

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3464kb

input:

output:

result:

ok 4 lines

Test #2:

score: 0

Accepted

time: 1ms

memory: 3476kb

input:

1000
10
16 16 16 16 16 16 16 16 16 16
10
16 16 16 16 16 16 16 16 17 16
10
16 16 16 16 16 16 16 18 16 16
10
16 16 16 19 16 16 16 16 16 16
10
16 16 16 16 20 16 16 16 16 16
10
17 16 16 16 17 16 16 16 16 16
10
16 16 16 16 16 16 16 16 18 17
10
16 16 19 16 16 16 16 17 16 16
10
17 16 16 16 16 16 16 20 16 1...

output:

result:

ok 1000 lines

Test #3:

score: -100

Wrong Answer

time: 0ms

memory: 3492kb

input:

output:

result:

wrong answer 18th lines differ - expected: '1', found: '0'