QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #566675 | #9308. World Cup | stcmuyi# | WA | 0ms | 3640kb | C++20 | 782b | 2024-09-16 01:09:24 | 2024-09-16 01:09:24 |
Judging History
answer
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);
#define endl '\n'
#define int long long
using namespace std;
signed main()
{
IOS;
int t; cin >> t;
while(t--)
{
vector<int> a(33),id(33);
for(int i = 1; i <= 32; ++i)
{
cin >> a[i];
id[i] = i;
}
sort(id.begin() + 1,id.end(),[&](int x,int y){return a[x] > a[y];});
int z = 1;
for(int i = 1; i <= 32; ++i) if(id[i] == 1) z = i;
if(z == 1) cout << 1 << endl;
else if(z <= 5) cout << 2 << endl;
else if(z <= 20) cout << 4 << endl;
else if(z <= 26) cout << 8 << endl;
else if(z <= 30) cout << 16 << endl;
else cout << 32 << endl;
}
return 0;
}
/*
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
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
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: 3640kb
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 16 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 2 1
result:
wrong answer 13th numbers differ - expected: '8', found: '4'