QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #568031 | #9308. World Cup | silenceiii | WA | 0ms | 3536kb | C++14 | 598b | 2024-09-16 15:00:33 | 2024-09-16 15:00:33 |
Judging History
answer
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<pair<int,int> >a(35,{0,0});
bool rule(pair<int,int>x,pair<int,int>y){
return x.first>y.first;
}
int main(){
int t; cin>>t;
while (t--){
for (int i=1;i<=32;i++){
int x; cin>>x;
a.push_back({x,i});
}
sort(a.begin()+1,a.begin()+33,rule);
int idx;
for (idx=1;idx<=32;idx++)
if (a[idx].second==1) break;
int s=1;
while (s<idx) s*=2;
cout<<s<<endl;
}
return 0;
}
/*
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
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3536kb
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:
64
result:
wrong answer 1st numbers differ - expected: '1', found: '64'