🏷 문제
![](https://velog.velcdn.com/images%2Fsorzzzzy%2Fpost%2F589d8005-1828-4036-ba56-289c5b1821dc%2F%E1%84%89%E1%85%B3%E1%84%8F%E1%85%B3%E1%84%85%E1%85%B5%E1%86%AB%E1%84%89%E1%85%A3%E1%86%BA%202021-08-10%20%E1%84%8B%E1%85%A9%E1%84%92%E1%85%AE%2010.26.13.png)
💡 코드
from sys import stdin
from collections import deque
N, M = map(int, stdin.readline().split())
graph = [ [] for _ in range(N+1) ]
def find(x):
q = deque()
q.append(x)
visited = [0] * (N+1)
visited[x] = 1
cnt = 1
while q:
newx = q.popleft()
for com in graph[newx]:
if visited[com] == 0:
visited[com] = 1
q.append(com)
cnt += 1
return cnt
for _ in range(M):
x, y = map(int, stdin.readline().split())
graph[y].append(x)
res_list = []
max_tmp = -1e9
for idx in range(1, N+1):
res = find(idx)
if res > max_tmp:
res_list = [idx]
max_tmp = res
elif res == max_tmp:
res_list.append(idx)
else:
continue
print(*res_list)
🔑