QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#573772 | #9308. World Cup | LinSta | WA | 0ms | 3588kb | C++17 | 717b | 2024-09-18 19:56:01 | 2024-09-18 19:56:01 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define debug(a) cout << #a << "=" << a << endl;
#define LL long long
const int N = 42;
const int MOD = 1e9 + 7;
LL a[N];
void solve() {
for (int i = 1; i <= 32; i++) {
cin >> a[i];
}
LL china = a[1];
sort(a + 1, a + 33);
LL sta = find(a + 1, a + 33, china) - a;
if (sta > 30) {
cout << (sta == 32 ? 1 : 2) << endl;
} else if (sta > 28) {
cout << 4 << endl;
} else if (sta > 24) {
cout << 8 << endl;
} else if (sta > 16) {
cout << 16 << endl;
} else {
cout << 32 << endl;
}
}
int main() {
int T;
cin >> T; // Number of test cases
while (T--) {
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 3572kb
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 32 32 32 32 32 32 32 32 32 32 32 32 32 16 16 16 16 16 16 16 16 8 8 8 8 4 4 2 1
result:
wrong answer 3rd numbers differ - expected: '16', found: '32'