Cod sursa(job #2508450)
Utilizator | Data | 12 decembrie 2019 10:43:01 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int p[50002],s[50002];
int main()
{
int n,m,i,j,x,y;
f>>n>>m;
for(i=1;i<=n;i++)
p[i]=i;
while(m--)
{
f>>x>>y;
if(p[x]>p[y])
swap(p[x],p[y]);
}
for(i=1;i<=n;i++)
s[p[i]]=i;
for(i=1;i<=n;i++)
g<<s[i]<<" ";
}