QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#565684 | #9308. World Cup | OldMemory | WA | 0ms | 3628kb | C++17 | 978b | 2024-09-15 22:00:56 | 2024-09-15 22:00:58 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> PII;
typedef long long LL;
const int INF = 0x3f3f3f3f3f3f3f3f;
bool multi = 1;
void solve() {
int n = 32;
vector<int> a(n + 1);
int cnt = 0;
for(int i = 1; i <= n; i++) {
cin >> a[i];
if(a[i] < a[1]) {
cnt++;
}
}
if(cnt <= 1) {
cout << 32 << '\n';
return;
}else if(cnt <= 5) {
cout << 16 << '\n';
return;
}else if(cnt <= 9) {
cout << 8 << '\n';
return;
}else if(cnt <= 23) {
cout << 4 << '\n';
return;
}else if(cnt <= 30) {
cout << 2 << '\n';
return;
}else{
cout << 1 << '\n';
return;
}
}
signed main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int T = 1;
if(multi) 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: 3540kb
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: 3628kb
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 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 2 2 2 2 1
result:
wrong answer 11th numbers differ - expected: '8', found: '4'