Cod sursa(job #1807433)
Utilizator | Slincu Serban serban | Data | 16 noiembrie 2016 16:37:48 |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#include <vector>
using namespace std;
vector<int> L[50005];
int c[50005];
int main()
{
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, x, y;
f >> n >> m;
for(int i = 1; i <= m; i ++) {
f >> x >> y;
L[x].push_back(y);
c[y] ++;
}
int nr = n;
while(nr > 0) {
for(int i = 1; i <= n; i ++) {
if(!c[i]) {
g << i << " ";
c[i] = -1;
nr --;
for(int j = 0; j < L[i].size(); j ++)
c[L[i][j]] --;
}
}
}
g << "\n";
return 0;
}