Submission #10373547


Source Code Expand

def main():
  n, m = input_list()
  box = [False]*n
  box[0] = True
  nums = [1]*n
  for i in range(m):
    x, y = input_list()
    if box[x-1]:
      box[y-1] = True
    nums[x-1] = nums[x-1] - 1
    nums[y-1] = nums[y-1] + 1
    if nums[x-1] == 0:
      box[x-1] = False
  print(box.count(True))
    

def input_list():
  return map(int, input().split())

import math
main()

Submission Info

Submission Time
Task B - Box and Ball
User knagao
Language Python (3.4.3)
Score 400
Code Size 396 Byte
Status AC
Exec Time 353 ms
Memory 4596 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 27
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt
Case Name Status Exec Time Memory
0_00.txt AC 18 ms 3064 KB
0_01.txt AC 18 ms 3064 KB
0_02.txt AC 18 ms 3064 KB
1_00.txt AC 18 ms 3060 KB
1_01.txt AC 18 ms 3064 KB
1_02.txt AC 18 ms 3064 KB
1_03.txt AC 18 ms 3060 KB
1_04.txt AC 326 ms 4596 KB
1_05.txt AC 349 ms 4596 KB
1_06.txt AC 322 ms 3828 KB
1_07.txt AC 337 ms 3828 KB
1_08.txt AC 219 ms 3572 KB
1_09.txt AC 226 ms 4340 KB
1_10.txt AC 79 ms 4084 KB
1_11.txt AC 138 ms 3316 KB
1_12.txt AC 28 ms 4468 KB
1_13.txt AC 288 ms 3956 KB
1_14.txt AC 162 ms 3444 KB
1_15.txt AC 275 ms 3316 KB
1_16.txt AC 23 ms 3956 KB
1_17.txt AC 334 ms 4596 KB
1_18.txt AC 308 ms 3700 KB
1_19.txt AC 353 ms 3444 KB
1_20.txt AC 325 ms 3316 KB
1_21.txt AC 271 ms 3700 KB
1_22.txt AC 343 ms 3956 KB
1_23.txt AC 100 ms 4084 KB