QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #580703 | #9308. World Cup | gaosihan | WA | 16ms | 10664kb | Python3 | 979b | 2024-09-21 23:15:13 | 2024-09-21 23:15:19 |
Judging History
answer
def solve_tournament(test_cases):
knockout_pairs = [
(0, 1), (2, 3), (4, 5), (6, 7),
(1, 0), (3, 2), (5, 4), (7, 6)
]
results = []
for teams in test_cases:
chinese_team = teams[0] # The strength of the Chinese team
team_strengths = sorted(teams, reverse=True)
if chinese_team == team_strengths[0]:
results.append(1)
elif chinese_team == team_strengths[1]:
results.append(2)
elif chinese_team in team_strengths[:4]:
results.append(4)
elif chinese_team in team_strengths[:8]:
results.append(8)
elif chinese_team in team_strengths[:16]:
results.append(16)
else:
results.append(32)
return results
t = int(input()) # Number of test cases
test_cases = [list(map(int, input().split())) for _ in range(t)]
results = solve_tournament(test_cases)
for result in results:
print(result)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 9ms
memory: 10612kb
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: 16ms
memory: 10664kb
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 32 32 32 32 32 32 32 32 32 32 32 32 32 32 16 16 16 16 16 16 16 16 8 8 8 8 4 4 2 1
result:
wrong answer 3rd numbers differ - expected: '16', found: '32'