QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#571829#9308. World CupjiangdongWA 0ms3596kbC++14577b2024-09-18 09:15:272024-09-18 09:15:27

Judging History

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

  • [2024-09-18 09:15:27]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3596kb
  • [2024-09-18 09:15:27]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int md=1e2+5;
int n;
int d[md],id[md];
void sf(int x){
    if(x==1)cout<<1;
    else if(x<=5)cout<<2;
    else if(x<=19)cout<<4;
    else if(x<=26)cout<<8;
    else if(x<=30)cout<<16;
    else cout<<32;
    cout<<'\n';
}
bool cmp(int x,int y){
    return d[x]>d[y];
}
void solve(){
    cin>>n;
    while(n--){
        for(int i=1;i<=32;i++)cin>>d[i],id[i]=i;
        sort(id+1,id+1+n,cmp);
        sf(id[1]);
    }
}
signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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

result:

wrong answer 2nd numbers differ - expected: '32', found: '16'