QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#570275 | #9308. World Cup | beet666666 | WA | 0ms | 3668kb | C++14 | 871b | 2024-09-17 15:05:04 | 2024-09-17 15:05:10 |
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.begin(), a.end());
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: 100
Accepted
time: 0ms
memory: 3648kb
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: 3668kb
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
result:
wrong answer Answer contains longer sequence [length = 32], but output contains 1 elements