Submission #76560798

Source Code Expand

N, T, P = map(int, input().split())
hairs = list(map(int, input().split()))
time = 0
counter = 0
while counter < P:
  counter = 0
  for i in range(N):
    if  hairs[i] >= T:
      counter += 1
  if time == 0 and counter >= P:
    print(0)
    exit()
  hairs = [x+1 for x in hairs]
  time += 1
print(time-1)

Submission Info

Submission Time
Task C - Japanese Cursed Doll
User Aze__
Language Python (CPython 3.13.7)
Score 200
Code Size 320 Byte
Status AC
Exec Time 12 ms
Memory 9228 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 24
Set Name Test Cases
Sample example_00.txt, example_01.txt, example_02.txt
All example_00.txt, example_01.txt, example_02.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt
Case Name Status Exec Time Memory
example_00.txt AC 11 ms 9152 KiB
example_01.txt AC 11 ms 8968 KiB
example_02.txt AC 11 ms 9080 KiB
hand_00.txt AC 11 ms 9044 KiB
hand_01.txt AC 12 ms 9000 KiB
hand_02.txt AC 11 ms 9140 KiB
hand_03.txt AC 11 ms 9228 KiB
hand_04.txt AC 11 ms 9000 KiB
hand_05.txt AC 12 ms 9168 KiB
random_00.txt AC 11 ms 9104 KiB
random_01.txt AC 11 ms 9152 KiB
random_02.txt AC 11 ms 9152 KiB
random_03.txt AC 11 ms 8968 KiB
random_04.txt AC 12 ms 8968 KiB
random_05.txt AC 11 ms 9000 KiB
random_06.txt AC 11 ms 9004 KiB
random_07.txt AC 12 ms 9228 KiB
random_08.txt AC 11 ms 8968 KiB
random_09.txt AC 11 ms 9080 KiB
random_10.txt AC 11 ms 8968 KiB
random_11.txt AC 11 ms 9080 KiB
random_12.txt AC 11 ms 9164 KiB
random_13.txt AC 12 ms 9044 KiB
random_14.txt AC 11 ms 9044 KiB