QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#571455 | #9308. World Cup | ewe | WA | 1ms | 3640kb | C++14 | 941b | 2024-09-17 23:12:23 | 2024-09-17 23:12:24 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define fopen \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout);
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) (x & -x)
#define i64 long long
#define pii pair<int, int>
const int N = 2e5 + 10, M = 4e5 + 10, mod = 1e9 + 7;
const double eps = 1e-6;
int val[N];
void solve()
{
for (int i = 1; i <= 32; ++i)
cin >> val[i];
int rk = 1;
for (int i = 2; i <= 32; ++i)
rk += val[i] > val[1];
if (rk == 1)
cout << 1;
else if (rk <= 13)
cout << 2;
else if (rk <= 23)
cout << 4;
else if (rk <= 28)
cout << 8;
else if (rk <= 30)
cout << 16;
else
cout << 32;
cout << '\n';
}
signed main()
{
// fopen;
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: 3520kb
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: 3640kb
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 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 2 2 2 2 2 2 2 2 2 2 2 2 1
result:
wrong answer 5th numbers differ - expected: '16', found: '8'