Cod sursa(job #2271901)
| Utilizator | Data | 29 octombrie 2018 14:42:19 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector <int> v[50001];
int lista[50001];
int nr[50001];
int main()
{
int n,m,x,y,i,val,p=-1,u=0;
in>>n>>m;
for(i=1; i<=m; i++)
{
in>>x>>y;
v[x].push_back(y);
nr[y]++;
}
for(i=1; i<=n; i++)
if(!nr[i])
lista[++p]=i;
while(u<=p)
{
val=lista[u];
out<<val<<" ";
for(i=0; i<v[val].size(); i++)
{
nr[v[val][i]]--;
if(nr[v[val][i]]==0)
lista[++p]=v[val][i];
}
++u;
}
return 0;
}
