Cod sursa(job #2348122)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 19 februarie 2019 13:26:10
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include<cstdio>
const int N=100001,M=1000000,L=12000000;
int s[N],c[N],*a[N],w[N],n,m,l=1,o,i,x[M],y[M],j,u,v;
char r[L];
int A()
{
  	int s=0;
  	for(;r[u]<'0'||r[u]>'9';u++);
  	for(;r[u]>='0'&&r[u]<='9';u++)
  		s=s*10+r[u]-'0';
  	return s;
}
void S(int b)
{
    char e[100];
    int j;
    if(b<0)
        b=-b,r[v++]='-';
    if(!b)
        r[v++]=48;
    for(j=0;b;b/=10,j++)
        e[j]=b%10+48;
    for(j--;j>=0;j--)
        r[v++]=e[j];
    r[v++]=' ';
}
int main()
{
	freopen("bfs.in","r",stdin),freopen("bfs.out","w",stdout),fread(r,1,L,stdin),n=A(),m=A(),o=A();
	for(i=0;i<m;i++)
		x[i]=A(),y[i]=A(),w[x[i]]++;
	for(i=1;i<=n;w[i++]=0)
		c[i]=-1,a[i]=new int[w[i]];
	for(i=0;i<m;i++)
		a[x[i]][w[x[i]]++]=y[i];
	for(c[o]=0,s[l]=o,i=1;i<=l;i++)
		for(j=0;j<w[s[i]];j++)
			if(c[a[s[i]][j]]==-1)
				s[++l]=a[s[i]][j],c[s[l]]=c[s[i]]+1;
	for(i=1;i<=n;i++)
		S(c[i]);
    fwrite(r,1,v,stdout);
}