QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #565640 | #9308. World Cup | oyasumi_sion | WA | 0ms | 3556kb | C++20 | 1.1kb | 2024-09-15 21:55:30 | 2024-09-15 21:55:30 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
void solve() {
std::vector<int> a(31);
int cn;
std::cin >> cn;
for (int i = 0; i < 31; i++) {
std::cin >> a[i];
}
std::sort(a.begin(), a.end());
int f = 0;
for (int i = 0; i < 31; i++) {
if (cn > a[0]) {
f = i + 1;
}
}
int ans = 32;
// if (f == 0) {
// ans = 32;
// } else if (f == 1) {
// ans = 32;
// } else if (f == 2) {
// ans = 16;
// } else if (f == 3) {
// ans = 16;
// } else if (f == 4) {
// ans = 16;
// } else if (f == 5) {
// ans = 16;
// } else if (f == 6) {
// ans = 8;
// } else if (f == 7) {
// ans = 8;
// } else if (f < 13) {
// ans = 8;
// } else if (f < ) {
// ans = 4;
// }
if (f < 2) {
ans = 32;
} else if (f < 6) {
ans = 16;
} else if (f < 13) {
ans = 8;
} else if (f < 27) {
ans = 4;
} else if (f < 31) {
ans = 2;
} else {
ans = 1;
}
std::cout << ans << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int t = 1;
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: 3556kb
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: 3552kb
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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
result:
wrong answer 2nd numbers differ - expected: '32', found: '1'