QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#575454#9308. World CupyylxWA 12ms10600kbPython31.2kb2024-09-19 14:27:572024-09-19 14:27:58

Judging History

你现在查看的是最新测评结果

  • [2024-09-19 14:27:58]
  • 评测
  • 测评结果:WA
  • 用时:12ms
  • 内存:10600kb
  • [2024-09-19 14:27:57]
  • 提交

answer

def best_possible_result(strengths):
  """
  Calculates the best possible result for the Chinese team in the World Cup.

  Args:
      strengths: A list of integers representing the strengths of all 32 teams.

  Returns:
      An integer representing the best possible result for the Chinese team:
      1: Champion, 2: Runner-up, 4: Semi-finalist, 8: Quarter-finalist,
      16: Round of 16, 32: Did not advance.
  """

  chinese_team_strength = strengths[0]  # Chinese team has strength a1

  # Sort strengths in descending order
  strengths.sort(reverse=True)

  # Find the rank of the Chinese team
  chinese_team_rank = strengths.index(chinese_team_strength) + 1

  # Determine the best possible result
  if chinese_team_rank == 1:
    return 1
  elif chinese_team_rank == 2:
    return 2
  elif chinese_team_rank <= 4:
    return 4
  elif chinese_team_rank <= 8:
    return 8
  elif chinese_team_rank <= 16:
    return 16
  else:
    return 32

# Read the number of test cases
t = int(input())

for _ in range(t):
  # Read the strengths of all teams
  strengths = list(map(int, input().split()))

  result = best_possible_result(strengths)
  print(result)

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 9ms
memory: 10520kb

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: 12ms
memory: 10600kb

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'