Cod sursa(job #3188191)

Utilizator matei__bBenchea Matei matei__b Data 2 ianuarie 2024 13:09:16
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.26 kb
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define chad char
#define mod 1'000'000'007
#define dim 100005
#define lim 1000000
#define mdim 1501
#define mult 2e9
#define maxx 200002
#define simaimult 1e17
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define pli pair<ll,int>
#define pil pair<int,ll>
#define piii pair<int,pair<int,int> > 
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define nr_biti __builtin_popcount
using namespace std;
 
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n,m;
vector<int> g[dim];
int v[dim];

int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr);
    fout.tie(nullptr); 
 
    fin >> n >> m;

    for(int i=1; i<=m; i++)
    {
        int x,y;

        fin >> x >> y;

        g[x].pb(y);
        v[y]++;
    }

    queue<int> q;

    for(int i=1; i<=n; i++)
        if(!v[i])
            q.push(i);

    while(q.size())
    {
        int nod=q.front();
        q.pop();

        fout << nod << ' ';

        for(auto it:g[nod])
        {
            v[it]--;

            if(!v[it])
                q.push(it);
        }
    }

    return 0;
}