QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#569981 | #9308. World Cup | LZXGDUT | WA | 15ms | 10624kb | Python3 | 1.0kb | 2024-09-17 13:03:37 | 2024-09-17 13:03:38 |
Judging History
answer
n = int(input())
for _ in range(n):
ans = 32
scores = list(map(int, input().split()))
score = scores[0]
scores.sort()
scores[scores.index(score)], scores[0] = scores[0], scores[scores.index(score)]
# pos = scores.index(score)+1
_all = [scores[i:i + 4] for i in range(0, 32, 4)]
[_all[i].sort() for i in range(8)]
# 进16强
_all = [_all[i][3:1:-1] for i in range(8)]
if score in _all[0]:
ans = 16
# 进8强
__all = []
for i in range(8):
__all.append(max(_all[i][0], _all[(i + 1) % 8][1]))
_all = [__all[i:i + 2] for i in range(0, 8, 2)]
if score in _all[0]:
ans = 8
__all = []
for i in range(4):
__all.append(max(_all[i][0], _all[i][1]))
_all = [__all[i:i + 2] for i in range(0, 4, 2)]
if score in _all[0]:
ans = 4
__all = []
for i in range(2):
__all.append(max(_all[i][0], _all[i][1]))
_all = __all
if score in _all:
ans = 2
if score == max(_all):
ans = 1
print(ans)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 10ms
memory: 10624kb
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: 15ms
memory: 10588kb
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 4 4 4 4 4 4 4 4 2 2 2 2 2 2 2 2 2 2 2 2 2 1
result:
wrong answer 11th numbers differ - expected: '8', found: '4'