Submission #3768876

Source Code Expand

n, m = map(int,input().split())
f = [False for _ in range(n)]
c = [1 for _ in range(n)]
f[0] = True
for i in range(m):
  x, y = map(int,input().split())
  f[y - 1] = f[y - 1] or f[x - 1]
  c[y - 1] += 1
  c[x - 1] -= 1
ans = 0
for i in range(n):
  if f[i] and c[i] > 0:
    ans += 1
print(ans)

Submission Info

Submission Time
Task B - Box and Ball
User mikit
Language Python (3.4.3)
Score 0
Code Size 308 Byte
Status WA
Exec Time 365 ms
Memory 4752 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
WA × 1
AC × 10
WA × 17
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 WA 18 ms 3060 KB
1_00.txt AC 18 ms 3064 KB
1_01.txt AC 18 ms 3060 KB
1_02.txt AC 18 ms 3064 KB
1_03.txt AC 18 ms 3060 KB
1_04.txt AC 340 ms 4752 KB
1_05.txt AC 365 ms 4656 KB
1_06.txt AC 338 ms 3888 KB
1_07.txt AC 350 ms 3864 KB
1_08.txt WA 227 ms 3760 KB
1_09.txt WA 247 ms 4400 KB
1_10.txt WA 92 ms 4248 KB
1_11.txt WA 138 ms 3316 KB
1_12.txt WA 40 ms 4568 KB
1_13.txt WA 284 ms 4144 KB
1_14.txt WA 168 ms 3444 KB
1_15.txt WA 276 ms 3316 KB
1_16.txt WA 30 ms 4016 KB
1_17.txt WA 363 ms 4656 KB
1_18.txt WA 309 ms 3760 KB
1_19.txt WA 350 ms 3504 KB
1_20.txt WA 322 ms 3316 KB
1_21.txt WA 275 ms 3760 KB
1_22.txt WA 334 ms 4144 KB
1_23.txt WA 111 ms 4272 KB