QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #571313 | #9308. World Cup | xlc2024 | WA | 0ms | 3856kb | C++14 | 757b | 2024-09-17 21:58:42 | 2024-09-17 21:58:42 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int val,pos,a[40];
int main(){
int T;
scanf("%d",&T);
while (T--){
for (int i=1;i<=32;i++) scanf("%d",&a[i]);
val=a[0];
sort(a,a+33);
for (int i=1;i<=32;i++) printf("%d ",a[i]);
for (int i=1;i<=32;i++)
if (val==a[i]){
pos=i;
break;
}
if (pos<3){
printf("32\n");
}else if (pos>=3 and pos<7){
printf("16\n");
}else if (pos>=7 and pos<8){
printf("8\n");
}else if (pos>=8 and pos<16){
printf("4\n");
}else if (pos>=16 and pos<32){
printf("2\n");
}else if (pos==32){
printf("1\n");
}
}
return 0;
}
/*
1
5 3 31 30 29 28 27 26 25 24 23 22 21 20
19 18 17 32 16 15 14 13 12 11 10 9 8 7 6
4 2 1
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3856kb
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 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 32
result:
wrong answer Output contains longer sequence [length = 33], but answer contains 1 elements