QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#567342 | #9308. World Cup | huanmeng | WA | 1ms | 3584kb | C++14 | 1.4kb | 2024-09-16 11:16:15 | 2024-09-16 11:16:17 |
Judging History
answer
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int t;
cin >> t; // 读取测试用例数量
while (t--) {
vector<long long> v(32); // 32 支队伍的实力
long long a1; // 中国队的实力
for (int i = 0; i < 32; i++) {
cin >> v[i];
if (i == 0) {
a1 = v[i]; // 中国队的实力在第 0 位
}
}
// 对队伍实力排序
sort(v.begin(), v.end(), greater<long long>());
// 计算比中国队实力强的队伍数量
int stronger_count = 0;
for (int i = 0; i < 32; i++) {
if (v[i] > a1) {
stronger_count++;
}
}
// 输出最终结果
if (stronger_count == 0) {
cout << 1 << endl; // 中国队赢得冠军
} else if (stronger_count == 1) {
cout << 2 << endl; // 中国队输掉决赛,获得亚军
} else if (stronger_count <= 3) {
cout << 4 << endl; // 中国队输掉半决赛
} else if (stronger_count <= 7) {
cout << 8 << endl; // 中国队输掉八强赛
} else if (stronger_count <= 15) {
cout << 16 << endl; // 中国队输掉16强赛
} else {
cout << 32 << endl; // 中国队未能晋级淘汰赛
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3544kb
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: 3584kb
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'