Cod sursa(job #3240975)
| Utilizator | Data | 24 august 2024 18:17:18 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,i,x,y,deg[50005],sol[50005];
vector <int> v[50005];
int main()
{
fin>>n>>m;
for (i=1; i<=m; i++)
{
fin>>x>>y;
v[x].push_back(y);
deg[y]++;
}
for (i=1; i<=n; i++)
if (deg[i]==0)
sol[++sol[0]]=i;
for (i=1; i<=n; i++)
{
x=sol[i];
for (y=0; y<v[x].size(); y++)
{
deg[v[x][y]]--;
if (deg[v[x][y]]==0)
sol[++sol[0]]=v[x][y];
}
}
for (i=1; i<=n; i++)
fout<<sol[i]<<" ";
return 0;
}
