Submission #10369525
Source Code Expand
n,m=map(int,input().split()) arr=[list(map(int,input().split())) for _ in range(m)] count=[1]*(n+1) s=set() s.add(1) for a,b in arr: if a in s: s.add(b) count[b]+=1 count[a]-=1 if count[a]==0: s.discard(a) print(len(s))
Submission Info
Submission Time | |
---|---|
Task | B - Box and Ball |
User | tanon710 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 251 Byte |
Status | WA |
Exec Time | 372 ms |
Memory | 34332 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 3060 KB |
0_01.txt | AC | 17 ms | 3060 KB |
0_02.txt | AC | 17 ms | 2940 KB |
1_00.txt | AC | 17 ms | 3064 KB |
1_01.txt | AC | 17 ms | 3060 KB |
1_02.txt | AC | 17 ms | 3060 KB |
1_03.txt | WA | 17 ms | 3064 KB |
1_04.txt | AC | 322 ms | 24936 KB |
1_05.txt | AC | 372 ms | 34332 KB |
1_06.txt | WA | 337 ms | 24584 KB |
1_07.txt | AC | 361 ms | 30372 KB |
1_08.txt | WA | 227 ms | 19052 KB |
1_09.txt | WA | 231 ms | 20680 KB |
1_10.txt | WA | 76 ms | 8532 KB |
1_11.txt | WA | 147 ms | 12964 KB |
1_12.txt | WA | 26 ms | 4332 KB |
1_13.txt | WA | 293 ms | 24932 KB |
1_14.txt | WA | 167 ms | 14624 KB |
1_15.txt | WA | 288 ms | 23008 KB |
1_16.txt | WA | 22 ms | 3700 KB |
1_17.txt | WA | 355 ms | 28720 KB |
1_18.txt | WA | 321 ms | 26392 KB |
1_19.txt | WA | 353 ms | 28584 KB |
1_20.txt | WA | 346 ms | 26552 KB |
1_21.txt | WA | 273 ms | 23480 KB |
1_22.txt | WA | 352 ms | 28924 KB |
1_23.txt | WA | 96 ms | 10188 KB |