UvaSolution/uva_10305_Ordering Tasks.cpp at master · Masum95/UvaSolution · 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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include<bits/stdc++.h>
#define pb(n) push_back(n)
#define bug cout<<"bug";
#define all(c) c.begin(),c.end()
#define fr(i,n) for(i=0;i<n;i++)
#define sf(n) scanf("%d",&n)
#define mst(n) memset(n,0,sizeof(n))
#define nl printf("\n")
#define lli long long int
#define tr(container,it) \
    for (auto it = container.begin(); it != container.end() ; ++it)

#define INF INT_MAX
#define MOD 1000000007
#define mp(i,j) make_pair(i,j)
#define mstn(n) memset(n,-1,sizeof(n))
#define infile freopen("in.txt","r",stdin)
#define outfile freopen("out.txt","w",stdout)
#define pr(a) cout<<cout<<a.a.first<<"  "<< a.a.second<<endl
#define V 5
using namespace std;

vector<int>  adlist[100+3];
bool from[100+3];
bool vis[100+3];
stack<int> sorted;
int topsortUtil(int node)
{
    vis[node]=1;
    for(int i=0; i<adlist[node].size(); i++)
    {
        if(!vis[adlist[node][i]])
            topsortUtil(adlist[node][i]);
    }
    sorted.push(node);
}
int topsort(int n)
{
    for(int i=1; i<=n; i++)
    {
        if(!vis[i])
        {
            topsortUtil(i);
        }
    }
}
int main()
{

    int n,m;

    while(scanf("%d %d",&n,&m)==2 && (n!=0 || m!=0))
    {
        mst(vis);
        for(int i=0; i<=100; i++) adlist[i].clear();


        for(int i=0; i<m; i++)
        {
            int f,s;
            scanf("%d %d",&f,&s);
            adlist[f].push_back(s);//, from[f]=from[s]=1;
        }
        topsort(n);
        printf("%d",sorted.top());
        sorted.pop();
        while(!sorted.empty())
        {
            printf(" %d",sorted.top());
            sorted.pop();
        }
        nl;

    }


}