Cod sursa(job #2134385)

Utilizator DimaTCDima Trubca DimaTC Data 17 februarie 2018 21:34:51
Problema BFS - Parcurgere in latime Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include<bits/stdc++.h>
#define NMAX 100005
using namespace std;

struct nod {
	int nr;
	nod* next;
};

typedef nod* lista;
lista lda[NMAX];
int viz[NMAX];
int n,m,x,y,X,S;
int Q[NMAX];

void add(int x, lista &p) {
	lista r=new nod({x,p});
	p=r;
}

void BFS(int x) {
	int st,dr;
	viz[x]=1;
	st=dr=1;
	Q[1]=x;
	while (st<=dr) {
		x=Q[st++];
		for (lista p=lda[x]; p; p=p->next) {
			if (!viz[p->nr]) { 
				viz[p->nr]=viz[x]+1;
				Q[++dr]=p->nr;
			}
		}
	}
}

int main() { 
	ifstream cin("bfs.in");
	ofstream cout("bfs.out");
	cin>>n>>m>>S;
	for (int i=1; i<=m; i++) {
		cin>>x>>y;
		add(y,lda[x]);
	}
	
	BFS(S);
	for (int i=1; i<=n; i++) {
		cout<<viz[i]-1<<" ";
	}
	
	return 0;
}