Cod sursa(job #422457)

Utilizator ClasianMunteanu Petre Clasian Data 22 martie 2010 18:37:11
Problema BFS - Parcurgere in latime Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include<fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
struct nod{ int c;
			nod*lg;
		  }*vf[100000],*r;
int p,q,n,m,i,s,x,y,que[1000000],ave[100000];
int main()
{
  f>>n>>m>>s;
  for(i=1;i<=n;i++) { vf[i]=new nod;
	                  vf[i]->c=0;
					  vf[i]->lg=0;
					}  
  for(i=1;i<=m;i++) { f>>x>>y; 
 					  r=new nod;r->c=y;
					  r->lg=vf[x]->lg;
					  vf[x]->c++;
					  vf[x]->lg=r;
					}
  p=q=1;
  ave[s]=1;que[1]=s;
  while(p<=q) { r=vf[que[p]]->lg;
			    while(r) { if(!ave[r->c]) { que[++q]=r->c;
											ave[r->c]=1+ave[que[p]];
										  }
						   r=r->lg;
						 }
			    p++;
              }		
  for(i=1;i<=n;i++)g<<ave[i]-1<<' ';g<<'\n'; 
  f.close();
  g.close();
  return 0;
}