ProgrammingProblems/uva10305.cpp at master · rishikesha/ProgrammingProblems · GitHub

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
54
55
56
/* Rishikesh
 * UVA 10305 Ordering Tasks
 */
#include<iostream>
#include<string>
#include<sstream>
#include<iomanip>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<iomanip>
#include<cstdint>
#include<numeric>
#include<stack>
#include<queue>
#include<list>
#include<deque>
#include<bitset>
#include<functional>

using namespace std;

void dfs(int node, vector<vector<int>> &adjlist, vector<int> &visited, vector<int> &exitorder){
    visited[node] = true;
    for(int nxt : adjlist[node]) {
        if (not visited[nxt]) {
            dfs(nxt, adjlist, visited, exitorder);
        }
    }
    exitorder.push_back(node);
}

int main() {
    int n,m;
    while(cin >> n >> m, n) {
        vector<vector<int>> adjlist(n);
        vector<int> visited(n, 0);
        vector<int> exitorder;
        for(int i = 0; i < m; i++) {
            int t1, t2;
            cin >> t1 >> t2;
            adjlist[--t1].push_back(--t2);
        }

        for(int i = 0; i < n; i++) {
            if (not visited[i]) {
                dfs(i, adjlist, visited, exitorder);
            }
        }
        cout << ++exitorder[n - 1];
        for(int i = n - 2; i >= 0; i--)
            cout << " " << ++exitorder[i];
        cout << "\n";
    }
}