QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#567445 | #9308. World Cup | musi | WA | 1ms | 3604kb | C++14 | 1.1kb | 2024-09-16 11:59:58 | 2024-09-16 11:59:58 |
Judging History
answer
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
vector<int> a(32);
for (int i = 0; i < 32; ++i) {
cin >> a[i];
}
int team1_strength = a[0];
int n_stronger = 0;
for (int i = 0; i < 32; ++i) {
if (a[i] > team1_strength) {
n_stronger++;
}
}
if (n_stronger == 0) {
cout << 1 << endl;
} else if (n_stronger <= 15) {
cout << 2 << endl;
} else {
int n_unavoidable = n_stronger - 15;
if (n_unavoidable <= 1) {
cout << 2 << endl;
} else if (n_unavoidable <= 3) {
cout << 4 << endl;
} else if (n_unavoidable <= 7) {
cout << 8 << endl;
} else if (n_unavoidable <= 15) {
cout << 16 << endl;
} else {
cout << 32 << endl;
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
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: 1ms
memory: 3544kb
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 16 16 16 16 16 16 16 16 8 8 8 8 4 4 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1
result:
wrong answer 2nd numbers differ - expected: '32', found: '16'