반응형
후 bfs dfs 모가지를 꺾어서 먹는게 오늘의 목표다!
기존 해쉬쓰는게 너무 비효율적인거 같아
이제 다른 사람처럼 리스트를 만들어서 하는 방향으로 이제 해보겠다!
|
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
46
47
48
49
50
51
52
53
|
coms_num = int(input())
net_num = int(input())
connect_db = {}
already_dict = {}
def connect(a,b):
if connect_db.get(a) == None:
connect_db[a] = [b]
else:
connect_db[a].append(b)
connect_db[a] = list(set(connect_db[a]))
number = 0
def dfs(now):
global number
already_dict[now] = 1
nownow = connect_db.get(now)
if nownow != None:
for i in nownow:
if already_dict.get(i) == None:
number +=1
already_dict[i] = 1
dfs(i)
return number
def bfs(now):
global number
already_dict[now] = 1
now_list = connect_db.get(now)
test = []
if now_list !=None:
test = now_list
else:
return 0
while len(test)!= 0:
now = test.pop(0)
if already_dict.get(now) == None:
number +=1
already_dict[now] = 1
check = connect_db.get(now)
if check != None:
for i in check:
if already_dict.get(i) == None:
test.append(i)
return number
for i in range(net_num):
a,b = map(int,input().split())
connect(a,b)
connect(b,a)
print(bfs(1))
|
cs |
Be positive!
Be rich!
Live your life!
반응형