QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#566780 | #9308. World Cup | Rapids | WA | 0ms | 3680kb | C++20 | 733b | 2024-09-16 01:42:09 | 2024-09-16 01:42:10 |
Judging History
answer
#include <bits/stdc++.h>
void solve() {
std::array<int, 32> team;
for (int i = 0; i < 32; i++) {
std::cin >> team[i];
}
int mark = team[0];
std::sort(team.begin(), team.end());
int cnt = std::lower_bound(team.begin(), team.end(), mark) - team.begin();
if (cnt < 2) {
std::cout << 32 << '\n';
} else if (cnt < 6) {
std::cout << 16 << '\n';
} else if (cnt < 13) {
std::cout << 8 << '\n';
} else if (cnt < 29) {
std::cout << 4 << '\n';
} else if (cnt < 31) {
std::cout << 2 << '\n';
} else {
std::cout << 1 << '\n';
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0), std::cout.tie(0);
int t;
std::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: 3668kb
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 16 16 16 16 8 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 1
result:
wrong answer 28th numbers differ - expected: '2', found: '4'