QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#567127 | #9308. World Cup | zzxuu | WA | 0ms | 3980kb | C++14 | 742b | 2024-09-16 08:12:07 | 2024-09-16 08:12:07 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll t;
scanf("%lld", &t);
while(t--){
ll a[10000];
for(ll i = 1; i <= 32; i ++)
scanf("%lld", &a[i]);
ll chn = a[1];
sort(a + 1, a + 1 + 32);
for(ll i = 1; i <= 32; i ++){
if(a[i] == chn){
chn = i;
break ;
}
}
if(chn == 32){
printf("1\n");
break ;
}
if(chn >= 1 && chn <= 2){
printf("32\n");
break ;
}
if(chn >= 3 && chn <= 6){
printf("16\n");
break ;
}
if(chn >= 7 && chn <= 13){
printf("8\n");
break ;
}
if(chn >= 14 && chn <= 27){
printf("4\n");
break ;
}
if(chn >= 28 && chn <= 31){
printf("2\n");
break ;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3920kb
input:
1 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3980kb
input:
32 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 3 1 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 4 1 2 3 5 6 7 8 9 10 11 12 13 14 15 ...
output:
32
result:
wrong answer Answer contains longer sequence [length = 32], but output contains 1 elements