QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#572857 | #9308. World Cup | accept_# | WA | 0ms | 3616kb | C++17 | 843b | 2024-09-18 16:36:12 | 2024-09-18 16:36:12 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fir first
#define sec second
#define ls u<<1
#define rs u<<1|1
#define P 131 //13331
#define ULL unsigned long long
const int N = 2e5 + 1000;
const int MOD = 998244353;
int a[44];
void solve() {
for (int i = 1; i <= 31; i++) {
cin >> a[i];
}
int id = 0;
for (int i = 2; i <= 31; i++) {
if (a[i] > a[1])id++;
}
if (id == 0) {
cout << "1\n";
}
else if (id <= 4) {
cout << "2\n";
}
else if (id <= 18) {
cout << "4\n";
}
else if (id <= 25) {
cout << "8\n";
}
else if (id <= 30) {
cout << "16\n";
}
else {
cout << "32\n";
}
}
signed main() {
IOS;
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: 3616kb
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: 3612kb
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:
16 1 2 2 2 2 4 4 4 4 4 4 4 4 4 4 4 4 4 8 8 8 8 8 8 8 16 16 16 16 16 16
result:
wrong answer 1st numbers differ - expected: '32', found: '16'