Submission #10369584
Source Code Expand
n,m=map(int,input().split()) arr=[list(map(int,input().split())) for _ in range(m)] count=[1]*(n+1) flag=[False]*(n+1) flag[1]=True for a,b in arr: count[b]+=1 count[a]-=1 if flag[a]==True: flag[b]=True if count[a]==0: flag[a]=False print(flag.count(True))
Submission Info
Submission Time | |
---|---|
Task | B - Box and Ball |
User | tanon710 |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 284 Byte |
Status | AC |
Exec Time | 367 ms |
Memory | 30884 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
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 | 17 ms | 3064 KB |
0_01.txt | AC | 17 ms | 3064 KB |
0_02.txt | AC | 17 ms | 3064 KB |
1_00.txt | AC | 17 ms | 3064 KB |
1_01.txt | AC | 17 ms | 3064 KB |
1_02.txt | AC | 17 ms | 3064 KB |
1_03.txt | AC | 17 ms | 3064 KB |
1_04.txt | AC | 349 ms | 25704 KB |
1_05.txt | AC | 365 ms | 30884 KB |
1_06.txt | AC | 346 ms | 24968 KB |
1_07.txt | AC | 367 ms | 28072 KB |
1_08.txt | AC | 231 ms | 18552 KB |
1_09.txt | AC | 234 ms | 19572 KB |
1_10.txt | AC | 81 ms | 8396 KB |
1_11.txt | AC | 144 ms | 12316 KB |
1_12.txt | AC | 29 ms | 4972 KB |
1_13.txt | AC | 303 ms | 23900 KB |
1_14.txt | AC | 166 ms | 13988 KB |
1_15.txt | AC | 285 ms | 22364 KB |
1_16.txt | AC | 23 ms | 4212 KB |
1_17.txt | AC | 354 ms | 27832 KB |
1_18.txt | AC | 331 ms | 25136 KB |
1_19.txt | AC | 365 ms | 27188 KB |
1_20.txt | AC | 333 ms | 25792 KB |
1_21.txt | AC | 282 ms | 22112 KB |
1_22.txt | AC | 360 ms | 27812 KB |
1_23.txt | AC | 101 ms | 10056 KB |