QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#573779#9308. World Cupwondering12138WA 0ms3720kbC++141.0kb2024-09-18 19:56:432024-09-18 19:56:43

Judging History

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

  • [2024-09-18 19:56:43]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3720kb
  • [2024-09-18 19:56:43]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;
const double eps = 1e-3;
const int N = 5e5+10;
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double INF = 1e9;
int a[N];
#define int long long
int ans = 0;

void Solve()
{
    int pos = 1;
    for(int i = 1 ; i <= 32; i ++){
        cin >> a[i];
        if(i == 1) pos = a[i];
    }
    int cn = 0;
    sort(a + 1, a + 1 + 32);
    for(int i = 1; i <= 32; i ++){
        if(a[i] == pos){
            cn = i;
            break;
        }
    }

    if(cn <= 2){
        cout << "32\n";
    }

    else if(cn <= 6){
        cout << "16\n";
    }

    else if(cn <= 12){
        cout << "8\n";
    }

    else if(cn <= 26){
        cout << "4\n";
    }

    else if(cn == 32){
        cout << "1\n";
    }
    else cout << "2\n";
}
signed main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int _ = 1;
    cin >> _;
    while(_ --){
        Solve();
    }

    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3720kb

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: 3676kb

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
16
16
16
16
8
8
8
8
8
8
4
4
4
4
4
4
4
4
4
4
4
4
4
4
2
2
2
2
2
1

result:

wrong answer 13th numbers differ - expected: '8', found: '4'