QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#573946 | #9308. World Cup | 2023_ljd# | WA | 0ms | 3712kb | C++14 | 877b | 2024-09-18 20:23:33 | 2024-09-18 20:23:33 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std ;
const int N = 2e5+10 ;
struct node {
int score , id ;
}a[50] ;
bool cmp(node &a , node &b) {
return a.score < b.score ;
}
void solve() {
for(int i=1 ; i<=32 ; i++){
cin >> a[i].score ;
a[i].id = i ;
}
sort(a+1 , a+32+1 , cmp) ;
int sc ;
for(int i=1 ; i<=32 ; i++)
if(a[i].id == 1) {
sc = i ; break ;
}
int ans = 0 ;
if(sc < 4) ans = 32 ;
else if(sc < 7) ans = 16 ;
else if(sc < 14) ans = 8 ;
else if(sc < 28) ans = 4 ;
else if(sc < 32) ans = 2 ;
else ans = 1 ;
cout << ans << endl ;
}
signed main() {
ios::sync_with_stdio(false) ;
cin.tie(nullptr) , cout.tie(nullptr) ;
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: 3712kb
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: 3600kb
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 16 16 16 8 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 2 1
result:
wrong answer 3rd numbers differ - expected: '16', found: '32'