Mai intai trebuie sa te autentifici.
Cod sursa(job #1017118)
| Utilizator | Data | 27 octombrie 2013 12:00:20 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.85 kb |
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
FILE *f=fopen("sortaret.in","r");
FILE *g=fopen("sortaret.out","w");
vector<int>v[50001];
vector<int>::iterator it;
int c[50001],n,m,i,a,b,nr[50001];
void solve();
void write();
int main()
{
fscanf(f,"%d%d",&n,&m);
for(i=1;i<=m;i++)
{
fscanf(f,"%d%d",&a,&b);
v[a].push_back(b);
nr[b]++;
}
solve();
write();
fclose(g);
return 0;
}
void solve()
{
int i;
for(i=1;i<=n;i++)
if(nr[i]==0)c[++c[0]]=i;
for(i=1;i<=n;i++)
{
int x=c[i];
for(it=v[x].begin(); it!=v[x].end();it++)
{
nr[*it]--;
if(nr[*it]==0) c[++c[0]] = *it;
}
}
}
void write()
{
int i;
for(i=1;i<=n;i++)
fprintf(g,"%d ",c[i]);
}
