QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #132465 | #6569. Splitting Pairs | Sorting# | WA | 1ms | 3536kb | C++ | 403b | 2023-07-29 23:57:06 | 2023-07-29 23:57:09 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
int s[101],t[101];
int d[101];
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++){
int 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";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3536kb
input:
4 3 1 1 1 3 1 1 2 3 2 2 2 4 4 4 4 4
output:
0 1 0 1
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 3428kb
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:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
result:
ok 1000 lines
Test #3:
score: -100
Wrong Answer
time: 1ms
memory: 3432kb
input:
1000 2 4 4 2 5 4 2 4 6 2 7 4 2 4 8 2 5 5 2 6 5 2 7 5 2 8 5 2 6 6 2 7 6 2 8 6 2 7 7 2 7 8 2 8 8 3 4 4 4 3 4 5 4 3 4 4 6 3 4 7 4 3 8 4 4 3 4 5 5 3 6 4 5 3 4 5 7 3 8 5 4 3 6 4 6 3 7 4 6 3 8 4 6 3 4 7 7 3 7 8 4 3 8 8 4 3 5 5 5 3 5 6 5 3 5 5 7 3 5 8 5 3 6 5 6 3 6 7 5 3 6 5 8 3 7 7 5 3 8 5 7 3 5 8 8 3 6 6...
output:
1 1 1 1 1 0 1 0 1 1 1 1 0 1 1 0 1 0 1 0 1 1 1 1 0 1 0 1 1 0 0 1 0 1 1 1 1 0 1 1 0 1 0 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 0 1 0 1 1 1 1 0 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 ...
result:
wrong answer 18th lines differ - expected: '1', found: '0'