2252번 줄 세우기

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

위상 정렬 참고 블로그 : https://jason9319.tistory.com/93

#include <iostream>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
#include <set>
#include <sstream>
#include <tuple>
 
#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")
 
using namespace std;
 
int N = 0, M = 0;
 
stack<int> stc;
 
vector<int> v[100100];
 
bool visit[100100] = { false, };
 
void DFS(int s)
{
    visit[s] = true;
 
    for (auto i : v[s])
        if (!visit[i]) DFS(i);
    
    stc.push(s);
}
 
void print()
{
    while (!stc.empty())
    {
        printf("%d ", stc.top());
        stc.pop();
    }
 
    printf("\n");
}
 
int main(void)
{
    int s = 0, e = 0;
 
    scanf("%d %d", &N, &M);
 
    while (M--)
    {
        scanf("%d %d", &s, &e);
 
        v[s].push_back(e);
    }
 
    for (int i = 1; i <= N; i++)
        if (!visit[i])    
            DFS(i);
 
    print();
 
    return 0;
}