QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#567650 | #9308. World Cup | retired_midlights | AC ✓ | 3ms | 3852kb | C++14 | 637b | 2024-09-16 13:16:43 | 2024-09-16 13:16:48 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int T, n= 32, a[MAXN], id[MAXN];
bool idcmp(int i, int j) {
return a[i] < a[j];
}
int main() {
scanf("%d", &T);
while(T--) {
for(int i=1;i<=32;++i) {
scanf("%d", &a[i]);
id[i] = i;
}
sort(id+1,id+n+1,idcmp);
int rk = 1;
while(id[rk]!=1) rk++;
if(rk<=2) puts("32");
else if(rk<=6) puts("16");
else if(rk<=13) puts("8");
else if(rk<=27) puts("4");
else if(rk<=31) puts("2");
else puts("1");
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
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: 0
Accepted
time: 0ms
memory: 3852kb
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 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 2 1
result:
ok 32 numbers
Test #3:
score: 0
Accepted
time: 3ms
memory: 3720kb
input:
1000 158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 628894325 731963982 822804784 450968417 430302156 982631932 161735902 880895728 923078537 707723857 189330739 910286918 802329211 404539679 303238506 317063340 492686568 773361868 125660...
output:
16 4 1 4 1 4 4 2 4 2 4 32 4 2 4 4 8 4 32 1 4 4 2 4 2 16 2 8 4 8 8 1 2 4 8 4 16 4 4 2 4 4 2 16 8 4 2 16 4 8 8 4 4 4 4 16 16 2 1 4 4 8 1 4 4 2 4 8 16 4 4 8 4 32 32 8 8 8 1 4 4 4 4 4 32 8 4 4 8 32 4 4 16 2 8 32 16 8 8 4 1 4 4 16 32 4 4 4 4 4 8 4 4 8 4 4 4 8 16 4 4 8 2 4 4 16 2 8 16 4 4 16 2 32 8 16 4 3...
result:
ok 1000 numbers
Extra Test:
score: 0
Extra Test Passed