QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#569221#9308. World CupyylxWA 0ms3820kbC++141.5kb2024-09-16 21:21:142024-09-16 21:21:20

Judging History

你现在查看的是最新测评结果

  • [2024-09-16 21:21:20]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3820kb
  • [2024-09-16 21:21:14]
  • 提交

answer

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t; // 测试用例数量
    cin >> t;
    while (t--) {
        vector<int> strength(32);
        int a1; // 中国队的实力值
        for (int i = 0; i < 32; ++i) {
            cin >> strength[i];
        }
        a1 = strength[0];

        // 计算比中国队实力强的球队数量 s
        int s = 0;
        for (int i = 1; i < 32; ++i) {
            if (strength[i] > a1) {
                ++s;
            }
        }

        int result;

        // 计算中国队小组中比自己强的最少球队数量
        int min_stronger_in_group = max(0, s - 21);

        if (s == 0) {
            result = 1; // 中国队赢得冠军
        } else if (min_stronger_in_group >= 2) {
            result = 32; // 无法出线
        } else if (min_stronger_in_group == 1) {
            result = 16; // 16 强输
        } else {
            // min_stronger_in_group == 0
            // 根据 s 的值判断中国队在淘汰赛中的表现
            if (s <= 1) {
                result = 2; // 决赛输
            } else if (s <= 3) {
                result = 4; // 半决赛输
            } else if (s <= 7) {
                result = 8; // 8 强输
            } else {
                result = 16; // 16 强输
            }
        }

        cout << result << '\n';
    }

    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: 0ms
memory: 3820kb

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
16
16
16
16
16
16
16
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'