QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#575450 | #9308. World Cup | yylx | WA | 1ms | 3624kb | C++14 | 1.3kb | 2024-09-19 14:26:14 | 2024-09-19 14:26:14 |
Judging History
answer
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
vector<int> strengths(32);
for (int i = 0; i < 32; ++i) {
cin >> strengths[i];
}
// The Chinese team has strength a1, which is strengths[0]
int chineseTeamStrength = strengths[0];
// Sort the strengths in descending order
sort(strengths.begin(), strengths.end(), greater<int>());
// Find the rank of the Chinese team
int chineseTeamRank = find(strengths.begin(), strengths.end(), chineseTeamStrength) - strengths.begin() + 1;
// Determine the best possible result
int result;
if (chineseTeamRank == 1) {
result = 1; // Champion
} else if (chineseTeamRank == 2) {
result = 2; // Runner-up
} else if (chineseTeamRank <= 4) {
result = 4; // Semi-finalist
} else if (chineseTeamRank <= 8) {
result = 8; // Quarter-finalist
} else if (chineseTeamRank <= 16) {
result = 16; // Round of 16
} else {
result = 32; // Did not advance
}
cout << result << endl;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
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: 3616kb
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'