QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#567233#9308. World CupLnianWA 0ms3556kbC++201.2kb2024-09-16 10:17:562024-09-16 10:17:59

Judging History

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

  • [2024-09-16 10:17:59]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3556kb
  • [2024-09-16 10:17:56]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

using i64 = long long;
using i128 = __int128;
using ull = unsigned long long;
#define pll pair<ll, ll>
#define pii pair<int, int>
#define vi vector<int>
#define fir(i, a, b) for (int i = a; i <= b; i++)
#define pqi priority_queue<int> // 优先队列

#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--)
    {
        vector<int> a(32);
        for (int i = 0; i < 32; i++)
        {
            cin >> a[i];
        }
        sort(all(a));

        int res = 1;
        for (int i = 1; i < 32; i++)
        {
            if (a[0] > a[i])
                res++;
        }

        if (res <= 2)
            cout << 32 << "\n";
        else if (res <= 6)
            cout << 16 << "\n";
        else if (res <= 13)
            cout << 8 << "\n";
        else if (res <= 27)
            cout << 4 << "\n";
        else if (res <= 31)
            cout << 2 << "\n";
        else
            cout << 1 << "\n";
    }
    return 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3556kb

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:

32

result:

wrong answer 1st numbers differ - expected: '1', found: '32'