QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#567587 | #9308. World Cup | donghedd | WA | 0ms | 3640kb | C++14 | 728b | 2024-09-16 12:53:23 | 2024-09-16 12:53:30 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define xx first
#define yy second
#define endl '\n'
const int N = 2e5 + 10;
void solve(){
int a[50];
for(int i = 1;i <= 32;i++)cin >> a[i];
int t = a[1];
sort(a + 1, a + 32);
int pos = upper_bound(a + 1, a + 33, t) - a - 1;
cout << pos << endl;
if(pos <= 2)cout << 32 << endl;
else if(pos <= 6)cout << 16 << endl;
else if(pos <= 13)cout << 8 << endl;
else if(pos <= 27)cout << 4 << endl;
else if(pos <= 31)cout << 2 << endl;
else cout << 1 << endl;
}
int main(){
int T = 1;
cin >> T;
while(T--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3640kb
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:
32 1
result:
wrong answer 1st numbers differ - expected: '1', found: '32'