Cod sursa(job #1229858)
| Utilizator | Data | 18 septembrie 2014 11:12:23 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
vector<int>L[50005];
int d[50005];
int main()
{
int x,y;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
L[x].push_back(y);
d[y]++;
}
int vf=0;
while(vf<n)
{
for(int i=1;i<=n;i++)
{
if(d[i]==0)
{
fout<<i<<" ";
d[i]=-1;
for(int j=0;j<L[i].size();j++) d[L[i][j]]--;
}
}
}
}
