Cod sursa(job #2878264)
| Utilizator | Data | 26 martie 2022 12:39:33 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
#define MAXN 50100
using namespace std;
ifstream f("sortaret.in"); ofstream g("sortaret.out");
int N, M,viz[MAXN],gri[MAXN];
vector <int> G[MAXN];
int main()
{ f>>N>>M;
for(int a,b,i=1;i<=M;i++) {f>>a>>b; G[a].push_back(b); gri[b]++;}
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
if(viz[j]==0 && gri[j]==0)
{ viz[j]= 1; g<<j<<' ';
for(unsigned k=0;k<G[j].size();k++) gri[G[j][k]]--;
break ;
}
g.close(); f.close(); return 0;
}
