Cod sursa(job #2523976)

Utilizator Sho10Andrei Alexandru Sho10 Data 14 ianuarie 2020 21:53:27
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.17 kb
/*
ID: Sho10
LANG: C++
TASK:
*/
#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,x,y,viz[50005];
vector<ll>v[50005];
vector<ll>lmao_gata;
queue<ll>q;
int32_t main(){
CODE_START;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
cin>>n>>m;
for(ll i=0;i<m;i++)
{
    cin>>x>>y;
    v[x].pb(y);
    viz[y]++;
}
ll node=0;
for(ll i=1;i<=n;i++)
if(!viz[i]){
    node=i;
 q.push(node);
}
while(!q.empty()){
    x=q.front();
    for(ll i=0;i<v[x].size();i++)
    {
        viz[v[x][i]]--;
        if(viz[v[x][i]]==0){
            q.push(v[x][i]);
        }
    }
    lmao_gata.pb(x);
    q.pop();
}
for(ll i=0;i<lmao_gata.size();i++)
    cout<<lmao_gata[i]<<' ';
}