QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#568062 | #9308. World Cup | xiaomo | WA | 1ms | 3812kb | C++20 | 782b | 2024-09-16 15:07:13 | 2024-09-16 15:07:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
void solve(){
vector<pair<ll,ll>> a(32);
for(ll i=0;i<32;i++){
a[i].second=i;
cin>>a[i].first;
}
sort(a.begin(),a.end());
// for(ll i=0;i<32;i++){
// cout<<a[i].first<<" "<<a[i].second<<endl;
// }
ll num=0;
for(ll i=0;i<32;i++){
if(a[i].second==0){
num=i+1;
break;
}
}
if(num==32){
cout<<1<<endl;
}else if(num<32&&num>=16){
cout<<2<<endl;
}else if(num<16&&num>=8){
cout<<4<<endl;
}else if(num<8&&num>=4){
cout<<8<<endl;
}else if(num<4&&num>=2){
cout<<16<<endl;
}else
{
cout<<32<<endl;
}
return;
}
int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
ll _;cin>>_;
while(_--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3812kb
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: 3552kb
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 16 16 8 8 8 8 4 4 4 4 4 4 4 4 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1
result:
wrong answer 2nd numbers differ - expected: '32', found: '16'