QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#110903	#6569. Splitting Pairs	He_Ren^#	WA	2ms	3740kb	C++17	424b	2023-06-04 16:33:47	2023-06-04 16:33:48

Judging History

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

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

[2023-06-04 16:33:48]
评测

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

查看

[2023-06-04 16:33:47]
提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

void solve(void)
{
	int n;
	scanf("%d",&n);
	int cnt = 0;
	for(int i=1; i<=n; ++i)
	{
		ll x;
		scanf("%lld",&x);
		cnt += x % 2 == 0;
	}
	
	if(cnt == 0 || (n % 2 == 1 && cnt == n))
		printf("0\n");
	else
		printf("1\n");
}

int main(void)
{
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 3740kb

input:

output:

result:

ok 4 lines

Test #2:

score: 0

Accepted

time: 1ms

memory: 3500kb

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: 3592kb

input:

output:

result:

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