QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#572842 | #9308. World Cup | wjynb666 | WA | 0ms | 3576kb | C++14 | 804b | 2024-09-18 16:34:17 | 2024-09-18 16:34:18 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define read_fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
void solve()
{
vector<int> a(33);
for(int i=1;i<=32;i++) cin>>a[i];
int x=a[1];
sort(a.begin()+1,a.end(),greater<int>());
int id=1;
while(a[id]!=x) id++;
if(id==1){
cout<<1<<"\n";
return ;
}
if(id<=(32-23)){
cout<<2<<"\n";
return ;
}
if(id<=(32-11)){
cout<<4<<"\n";
return ;
}
if(id<=(32-5)){
cout<<8<<"\n";
return ;
}
if(id<=(32-2)) {
cout<<16<<"\n";
return ;
}
cout<<32<<"\n";
}
int main()
{
read_fast;
int t;
cin>>t;
while(t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
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 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 2 1
result:
wrong answer 6th numbers differ - expected: '16', found: '8'