Cod sursa(job #2428457)

Utilizator Joystick6208Catalin Topala Joystick6208 Data 5 iunie 2019 13:01:16
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include <cstdio>
#include <vector>
using namespace std;

#define maxsize 50005

int n, m, x, y;
vector<int> gr[maxsize];
int c[maxsize], deg[maxsize], lg[maxsize];

void sort()
{
	int u, v;

    int l = 0;
	for(int i = 1; i <= n; ++i)
		if(deg[i] == 0)
			c[++l] = i;

	for(int i = 1; i <= n; ++i)
	{
		u = c[i];
		for(int j = 0; j < lg[u]; ++j)
		{
			v = gr[u][j];

			--deg[v];
			if(deg[v] == 0)
				c[++l] = v;
		}
	}
}

int main()
{

	freopen("sortaret.in", "r", stdin);
	freopen("sortaret.out", "w", stdout);

	scanf("%d %d", &n, &m);

	for(int i = 0; i < m; ++i)
	{
		scanf("%d %d", &x, &y);

		gr[x].push_back(y);
		++deg[y];
	}

	for(int i = 1; i <= n; ++i)
	    lg[i] = gr[i].size();

	sort();

	for(int i = 1; i <= n; ++i)
		printf("%d ", c[i]);

	return 0;
}