Submission #2516190
Source Code Expand
import sys sys.setrecursionlimit(10**9) n, m = map(int, input().split()) a = [[0] * n for i in range(n)] for i in range(m): b = list(map(int, input().split())) a[b[0]-1][b[1]-1] = 1 a[b[1]-1][b[0]-1] = 1 road = [[0] * n for i in range(n)] count = 0 node = [0 for i in range(n)] def dfs(v): for i in range(n): if a[v][i] == 1 and (road[v][i] == 0 and road[i][v] == 0): if node[i] == 1: global ans ans = 0 road[v][i] = 1 node[i] = 1 dfs(i) for i in range(n): if node[i] == 0: node[i] = 1 ans = 1 dfs(i) count += ans print(count)
Submission Info
Submission Time | |
---|---|
Task | B - バウムテスト |
User | mizukurage |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 706 Byte |
Status | AC |
Exec Time | 112 ms |
Memory | 7412 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 17 ms | 3064 KB |
subtask0_sample_02.txt | AC | 17 ms | 3064 KB |
subtask0_sample_03.txt | AC | 17 ms | 3064 KB |
subtask1_01.txt | AC | 18 ms | 3064 KB |
subtask1_02.txt | AC | 17 ms | 3064 KB |
subtask1_03.txt | AC | 17 ms | 3064 KB |
subtask1_04.txt | AC | 20 ms | 3188 KB |
subtask1_05.txt | AC | 18 ms | 3064 KB |
subtask1_06.txt | AC | 18 ms | 3064 KB |
subtask1_07.txt | AC | 18 ms | 3064 KB |
subtask1_08.txt | AC | 18 ms | 3064 KB |
subtask1_09.txt | AC | 18 ms | 3064 KB |
subtask1_10.txt | AC | 17 ms | 3064 KB |
subtask1_11.txt | AC | 18 ms | 3064 KB |
subtask1_12.txt | AC | 17 ms | 3064 KB |
subtask1_13.txt | AC | 21 ms | 3188 KB |
subtask1_14.txt | AC | 18 ms | 3188 KB |
subtask1_15.txt | AC | 19 ms | 3188 KB |
subtask1_16.txt | AC | 20 ms | 3188 KB |
subtask1_17.txt | AC | 19 ms | 3188 KB |
subtask1_18.txt | AC | 19 ms | 3188 KB |
subtask1_19.txt | AC | 19 ms | 3188 KB |
subtask1_20.txt | AC | 18 ms | 3188 KB |
subtask1_21.txt | AC | 19 ms | 3188 KB |
subtask1_22.txt | AC | 18 ms | 3188 KB |
subtask1_23.txt | AC | 19 ms | 3188 KB |
subtask1_24.txt | AC | 19 ms | 3188 KB |
subtask1_25.txt | AC | 17 ms | 3064 KB |
subtask1_26.txt | AC | 19 ms | 3188 KB |
subtask1_27.txt | AC | 19 ms | 3188 KB |
subtask1_28.txt | AC | 18 ms | 3188 KB |
subtask1_29.txt | AC | 110 ms | 7412 KB |
subtask1_30.txt | AC | 112 ms | 7412 KB |
subtask1_31.txt | AC | 18 ms | 3188 KB |