Cod sursa(job #1704247)

Utilizator bence21Bako Bence bence21 Data 18 mai 2016 13:36:55
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include<fstream>
#include<vector>
using namespace std;
vector<unsigned int> t[50000];
bool r[50000];
ofstream g("sortaret.out");
void megy(int j)
{
	r[j]=1;
	g<<j<<" ";
	/*vector<unsigned int>::iterator it;
	it=t[j].begin();
	while(it!=t[j].end())
	{
		if(r[*it]==0)
			megy(*it);
		it++;
	}*/
	for(auto&i:t[j])
		if(!r[i])
			megy(i);/*
	for each (unsigned int i in t[j])
		if(!r[i])
			megy(i);*/
}
int main()
{
	vector<unsigned int>::iterator it;
	ifstream f("sortaret.in");
	unsigned int i,n,m,a,b;
	f>>n>>m;
	for(i=1;i<=m;i++)
	{
		f>>a>>b;
		t[a].push_back(b);
		t[b].push_back(a);
	}
	for(i=1;i<=n;i++)
	{
		if(r[i]==0)
		{
			megy(i);
		}
	}
	f.close();
	g.close();
	return 0;
}