QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#566600 | #9308. World Cup | zeemanz# | WA | 0ms | 3872kb | C++20 | 893b | 2024-09-16 00:42:50 | 2024-09-16 00:42:51 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
constexpr int n = 32;
void solve() {
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> p(n);
iota(p.begin(), p.end(), 0);
sort(p.begin(), p.end(), [&](int i, int j) { return a[i] > a[j]; });
int rnk = find(p.begin(), p.end(), 0) - p.begin() + 1;
if (rnk <= 1) {
cout << "1\n";
} else if (rnk <= 5) {
cout << "2\n";
} else if (rnk <= 19) {
cout << "4\n";
} else if (rnk <= 26) {
cout << "8\n";
} else if (rnk <= 29) {
cout << "16\n";
} else {
cout << "32\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(16);
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: 3628kb
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: 3872kb
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 16 16 16 8 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 2 1
result:
wrong answer 3rd numbers differ - expected: '16', found: '32'