QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#570269#9308. World Cupbeet666666WA 1ms3836kbC++14873b2024-09-17 15:02:072024-09-17 15:02:08

Judging History

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

  • [2024-09-17 15:02:08]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3836kb
  • [2024-09-17 15:02:07]
  • 提交

answer

#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;

using i64 = long long;
using pii = pair<int,int>;

void solve(){
    vector<pii> a;
    for(int i=1; i<=32; i++){
        int x;  cin>>x;
        a.push_back({x,i});
    }
    sort(a.rbegin(), a.rend());
    int tar = 0;
    for(int i=0; i<32; i++){
        if(a[i].second==1){
            tar = i+1;
            break;
        }
    }


    if(tar==1){
        cout<<1<<endl;
    }else if(tar<=5){
        cout<<2<<endl;
    }else if(tar<= 19){
        cout<<4<<endl;
    }else if(tar<= 26){
        cout<<8<<endl;
    }else if(tar<=30){
        cout<<16<<endl;
    }else{
        cout<<32<<endl;
    }

}

signed main()
{
    IOS;
    int T = 1;
    //cin>>T;
    while(T--){
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3836kb

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'