QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#573297 | #9308. World Cup | YuFei_Zhou | WA | 1ms | 3792kb | C++17 | 845b | 2024-09-18 18:04:45 | 2024-09-18 18:04:46 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
const int N = 1e6 + 10;
const int mod = 998244353;;
void solve() {
vector<int> a(33,0);
int chn = a[1];
cin>>chn;
int cnt = 0;
for (int i = 1; i <= 31; ++i) {
cin>>a[i];
if(a[i] < chn){
cnt++;
}
}
if(cnt <= 1){
cout<<"32"<<endl;
} else if(cnt <= 5){
cout<<"16"<<endl;
} else if(cnt <= 6){
cout<<"8"<<endl;
} else if(cnt <= 14){
cout<<"4"<<endl;
} else if(cnt <= 30){
cout<<"2"<<endl;
} else {
cout<<"1"<<endl;
}
}
signed main() {
//ios::sync_with_stdio(false);cin.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
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: 1ms
memory: 3792kb
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 32 16 16 16 16 8 4 4 4 4 4 4 4 4 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1
result:
wrong answer 8th numbers differ - expected: '8', found: '4'