QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#567193 | #9308. World Cup | makabaka | WA | 0ms | 3624kb | C++14 | 860b | 2024-09-16 09:54:27 | 2024-09-16 09:54:27 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+5;
int n;
typedef pair<ll,ll> PII;
int a[34],b[34];
bool cmp(int a,int b){
return a>b;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
int mmax=0;
for (int i=1;i<=32;i++){
cin>>a[i];
mmax=max(a[i],mmax);
}
if(mmax==a[1]){
cout<<1<<endl;
}
else{
int pos=0;
memcpy(b,a,sizeof a);
sort(a+1,a+33);
for (int i=1;i<=32;i++){
if(b[1]==a[i]){
pos=i;
break;
}
}
if(pos<3){
cout<<32<<endl;
}
else if(pos<7){
cout<<16<<endl;
}
else if(pos<13){
cout<<8<<endl;
}
else if(pos<25){
cout<<4<<endl;
}
else {
cout<<2<<endl;
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
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: 3576kb
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 32 16 16 16 16 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 2 2 2 2 1
result:
wrong answer 13th numbers differ - expected: '8', found: '4'