QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#566670 | #9308. World Cup | Kopicy | WA | 0ms | 3796kb | C++23 | 680b | 2024-09-16 01:07:34 | 2024-09-16 01:07:36 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define sz(x) (int)x.size()
const int N=2000;
void solve(){
int n=32;
vector<array<int,2>> a(n+1);
rep(i,1,n) cin>>a[i][0],a[i][1]=i;
sort(a.begin()+1,a.end());
int rk=a[1][1];
if(rk<3) cout<<32<<'\n';
else if(rk>=3 && rk<7) cout<<16<<'\n';
else if(rk==7) cout<<8<<'\n';
else if(rk>=8 && rk<16) cout<<4<<'\n';
else if(rk>=16 && rk<32) cout<<2<<'\n';
else if(rk==32) cout<<1<<'\n';
}
signed main() {
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
cin>>t;
while(t--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
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: 3796kb
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 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32
result:
wrong answer 3rd numbers differ - expected: '16', found: '32'