Submission #3768882
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 if c[x - 1] == 0: f[x - 1] = False 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 | 400 |
Code Size | 351 Byte |
Status | AC |
Exec Time | 378 ms |
Memory | 4656 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 | 18 ms | 3060 KB |
0_01.txt | AC | 17 ms | 3064 KB |
0_02.txt | AC | 18 ms | 3064 KB |
1_00.txt | AC | 18 ms | 3064 KB |
1_01.txt | AC | 18 ms | 3064 KB |
1_02.txt | AC | 18 ms | 3064 KB |
1_03.txt | AC | 18 ms | 3064 KB |
1_04.txt | AC | 370 ms | 4656 KB |
1_05.txt | AC | 374 ms | 4656 KB |
1_06.txt | AC | 361 ms | 3892 KB |
1_07.txt | AC | 378 ms | 3888 KB |
1_08.txt | AC | 241 ms | 3760 KB |
1_09.txt | AC | 240 ms | 4400 KB |
1_10.txt | AC | 91 ms | 4272 KB |
1_11.txt | AC | 140 ms | 3316 KB |
1_12.txt | AC | 39 ms | 4528 KB |
1_13.txt | AC | 308 ms | 4144 KB |
1_14.txt | AC | 180 ms | 3564 KB |
1_15.txt | AC | 286 ms | 3316 KB |
1_16.txt | AC | 30 ms | 4016 KB |
1_17.txt | AC | 362 ms | 4656 KB |
1_18.txt | AC | 323 ms | 3760 KB |
1_19.txt | AC | 352 ms | 3504 KB |
1_20.txt | AC | 332 ms | 3316 KB |
1_21.txt | AC | 292 ms | 3760 KB |
1_22.txt | AC | 366 ms | 4144 KB |
1_23.txt | AC | 110 ms | 4272 KB |