[acmicpc] 2252. 줄 세우기(python)

위상정렬 알고리즘

 

예제 입력 1

3 2
1 3
2 3

그림 설명

---

정답코드

import sys
from collections import deque
input=sys.stdin.readline

def solve():
    N,M=map(int,input().split())
    arr=[[] for _ in range(N+1)]
    count=[0]*(N+1)
    queue=deque()
    
    for _ in range(M):
        A,B=map(int,input().split())
        count[B]+=1
        arr[A].append(B)
        
    for i in range(1,N+1):
        if count[i]==0:
            queue.append(i)
            
    while queue:
        now=queue.popleft()
        for num in arr[now]:
            count[num]-=1
            if count[num]==0:
                queue.append(num)
        print(now, end=' ')
solve()

---

https://www.acmicpc.net/problem/2252

2252번: 줄 세우기