Pagini recente » Cod sursa (job #2115139) | Cod sursa (job #2691724) | Cod sursa (job #725081) | Cod sursa (job #2294639) | Cod sursa (job #3237109)
#include <fstream>
#include <set>
#include <queue>
#include <vector>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
queue<int> q;
vector<vector<int>> graf;
vector<int> linie,nr_noduri,sir_final;
int main()
{
ios_base::sync_with_stdio(false);
int n,m,i,j,k,x;
fin>>n>>m;
for(i=0;i<=n;i++)
{
graf.push_back(linie);
nr_noduri.push_back(0);
}
for(i=0;i<m;i++)
{
fin>>j>>k;
graf[j].push_back(k);
nr_noduri[k]++;
}
for(i=1;i<=n;i++)
if(nr_noduri[i]==0)
{
q.push(i);
nr_noduri[i]=-1;
}
while(!q.empty())
{
x=q.front();
q.pop();
sir_final.push_back(x);
for(i=0;i<graf[x].size();i++)
{
if(nr_noduri[graf[x][i]]==1)
{
q.push(graf[x][i]);
nr_noduri[graf[x][i]]=-1;
}
else
nr_noduri[graf[x][i]]--;
}
}
for(i=0;i<n;i++)
fout<<sir_final[i]<<' ';
fout<<'\n';
return 0;
}