-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathflying safely.py
45 lines (43 loc) · 1.1 KB
/
flying safely.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
from collections import defaultdict
cases = int(input())
for _ in range(cases):
n, m = map(int, input().split())
visited = [0] * (n + 1)
AL = defaultdict(list)
for _ in range(m):
a, b = map(int, input().split())
AL[a].append(b)
AL[b].append(a)
visited[1] = 1
frontier = [1]
counter = 0
while frontier:
current = frontier.pop()
for i in AL[current]:
if visited[i] != 1:
visited[i] = 1
counter += 1
frontier.append(i)
print(counter)
"""
cases = int(input())
for _ in range(cases):
n, m = map(int, input().split())
AM = [[0]*n]*n
for _ in range(m):
a, b = map(int, input().split())
AM[a-1][b-1] = 1
AM[b-1][a-1] = 1
visited = [0] * n
visited[0] = 1
frontier = [0]
counter = 0
while frontier:
current = frontier.pop(0)
for i in range(n):
if not visited[i] and AM[current][i]:
visited[i] = 1
frontier.append(i)
counter += 1
print(counter)
"""