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
|
#Uses python3
import sys
def explore(adj, visited, x, y):
visited.append(x)
if x == y:
return
for i in adj[x]:
if i not in visited:
explore(adj, visited, i, y)
def reach(adj, x, y):
visited = []
if x == y:
return 1
explore(adj, visited, x, y)
if y in visited:
return 1
return 0
if __name__ == '__main__':
input = sys.stdin.read()
data = list(map(int, input.split()))
n, m = data[0:2]
data = data[2:]
edges = list(zip(data[0:(2 * m):2], data[1:(2 * m):2]))
x, y = data[2 * m:]
adj = [[] for _ in range(n)]
x, y = x - 1, y - 1
for (a, b) in edges:
adj[a - 1].append(b - 1)
adj[b - 1].append(a - 1)
print(reach(adj, x, y))
|
