Cod sursa(job #1362053)

Utilizator fluture.godlikeGafton Mihnea Alexandru fluture.godlike Data 26 februarie 2015 09:56:57
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <stdio.h>
#include <vector>
#define NMAX 100023
FILE *fin, *fout;
int n, m, s, x, y, c[NMAX], pos = 1, viz[NMAX], sizen;
struct coada
{
	int nr;
	int cost;
} q[NMAX];
std::vector<int> adj[NMAX];
int main()
{
	fin = freopen("bfs.in", "r", stdin);
	fout = freopen("bfs.out", "w", stdout);
	scanf("%d%d%d", &n, &m, &s);
	for(int i = 0; i< m; i++)
	{
		scanf("%d%d", &x, &y);
		adj[x].push_back(y);
	}
	viz[s] = 1;
	q[0].nr = s;
	q[0].cost = 0;
	for(int i = 0; i< pos; i++)
	{
		sizen = adj[q[i].nr].size();
		for(int j = 0; j< sizen; j++)
		{
			if(viz[adj[q[i].nr][j]]) continue;
			viz[adj[q[i].nr][j]] = 1;
			c[adj[q[i].nr][j]] = q[i].cost+1;
			q[pos].nr = adj[q[i].nr][j];
			q[pos].cost = q[i].cost+1;
			pos++;
		}
	}
	for(int i = 1; i<= n; i++)
	{
		if(c[i] == 0 && i != s) c[i] = -1;
	}
	for(int i = 1; i<= n; i++) printf("%d ", c[i]);printf("\n");
	fclose(fin);
	fclose(fout);
	return 0;
}