QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#565137 | #9308. World Cup | Sakuray | WA | 1ms | 3608kb | C++14 | 749b | 2024-09-15 20:24:18 | 2024-09-15 20:24:18 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve(const int &Case){
int n;
while(n--){
std::vector<int> a(32);
int cnt = 0;
for(int i = 0; i < 32; ++ i){
cin >> a[i];
if(a[i] < a[0])
cnt ++;
}
if(cnt >= 31){
cout << 1 << '\n';
}else if(cnt >= 27){
cout << 2 << '\n';
}else if(cnt >= 13){
cout << 4 << '\n';
}else if(cnt >= 6){
cout << 8 << '\n';
}else if(cnt >= 2){
cout << 16 << '\n';
}
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
solve(1);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3608kb
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:
result:
wrong answer Answer contains longer sequence [length = 1], but output contains 0 elements