QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#569758 | #9308. World Cup | uolo778 | WA | 0ms | 3620kb | C++14 | 741b | 2024-09-17 10:18:03 | 2024-09-17 10:18:07 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 10;
int a[33];
inline bool cmp(int a, int b) {
return a>b;
}
void solve() {
for(int i = 1; i<=32; i++)
cin>>a[i];
int tmp = a[1], index;
sort(a+1, a+33, cmp);
for(int i = 1; i<=32; i++) {
if(a[i] == tmp) index = i;
}
if(index == 1) cout<<1<<'\n';
else if(index >= 2 && index <= 9) cout<<2<<'\n';
else if(index >= 10 && index <= 20) cout<<4<<'\n';
else if(index >=21 && index <=27) cout<<8<<'\n';
else if(index>=28 && index <= 30) cout<<16<<'\n';
else cout<<32<<'\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
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: 3620kb
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: 3620kb
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 8 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'