QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#165675 | #6569. Splitting Pairs | PhantomThreshold# | WA | 2ms | 3436kb | C++20 | 586b | 2023-09-05 20:41:20 | 2023-09-05 20:41:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int T,n;
int a[10050];
bool solve(){
if (n%2==0){
for (int i=1;i<=n;i++) if (a[i]%2==0) return true;
return false;
}
int cnt0=0,cnt1=0;
for (int i=1;i<=n;i++){
if (a[i]%2==0) cnt0++;
else cnt1++;
}
if (cnt1==n) return false;
if (cnt0==n){
for (int i=1;i<=n;i++) a[i]/=2;
return solve();
}
return true;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> T;
for (;T--;){
cin >> n;
for (int i=1;i<=n;i++) cin >> a[i];
cout << solve() << "\n";
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3436kb
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: 2ms
memory: 3388kb
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: 0
Accepted
time: 1ms
memory: 3408kb
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 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 1 0 1 1 0 1 1 1 1 1 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 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 #4:
score: 0
Accepted
time: 1ms
memory: 3420kb
input:
1000 3 4 4 4 3 4 5 4 3 4 6 4 3 4 7 4 3 4 4 8 3 5 4 5 3 4 5 6 3 5 4 7 3 4 8 5 3 4 6 6 3 6 4 7 3 6 4 8 3 7 7 4 3 4 7 8 3 8 4 8 3 5 5 5 3 5 6 5 3 5 7 5 3 5 8 5 3 6 5 6 3 7 5 6 3 8 6 5 3 7 7 5 3 7 5 8 3 8 8 5 3 6 6 6 3 6 7 6 3 8 6 6 3 7 7 6 3 6 8 7 3 8 6 8 3 7 7 7 3 7 7 8 3 8 8 7 3 8 8 8 5 4 4 4 4 4 5 4...
output:
0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 1 0 1 1 0 1 1 1 1 1 0 1 1 0 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 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 1 1 1 1 1 1 1 1 ...
result:
ok 1000 lines
Test #5:
score: -100
Wrong Answer
time: 1ms
memory: 3404kb
input:
1000 49 70984400896 988463235072 689895899136 448069107712 139972313088 432801841152 571884961792 572723822592 147287179264 253252075520 941688356864 914542821376 100344528896 317945020416 796062121984 504306335744 30417092608 36054237184 652314935296 547994206208 335393325056 959203770368 824583389...
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:
wrong answer 1st lines differ - expected: '0', found: '1'