QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#572776 | #9308. World Cup | Ponderous | WA | 0ms | 3680kb | C++20 | 826b | 2024-09-18 16:20:21 | 2024-09-18 16:20:21 |
Judging History
answer
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef pair<int,int> pii;
using i64 = long long;
using u64 = unsigned long long;
const int N = 1e5 + 10;
void solve()
{
int n, k, num = 0;
cin >> n >> k;
for(int i = 0; i < n - 1; i ++)
{
int x;
cin >> x;
if(k > x) num ++;
}
if(num < 2) cout << 32 << "\n";
else if(num >= 2 && num < 6) cout << 16 << "\n";
else if(num >= 6 && num < 13) cout << 8 << "\n";
else if(num >= 13 && num < 27) cout << 4 << "\n";
else if(num >= 27 && num < 31) cout << 2 << "\n";
else cout << 1 << "\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
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: 3600kb
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: 3680kb
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 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
result:
wrong answer 3rd numbers differ - expected: '16', found: '32'