QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#570269 | #9308. World Cup | beet666666 | WA | 1ms | 3836kb | C++14 | 873b | 2024-09-17 15:02:07 | 2024-09-17 15:02:08 |
Judging History
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;
}
详细
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'