Cod sursa(job #1334185)
| Utilizator | Data | 4 februarie 2015 00:34:54 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream o("sortaret.out");
vector <int> a[50100];
int n,m,d[50200];
void df(int x){
d[x]=1;
for(int i=0;i<a[x].size();i++)
if(d[a[x][i]]==0)df(a[x][i]);
o<<x<<" ";
}
int main(){
f>>n>>m;
int x,y;
for(int i=1;i<=m;i++)f>>x>>y,a[y].push_back(x);
for(int i=1;i<=n;i++)if(d[i]==0)df(i);
}
