Cod sursa(job #2420871)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 13 mai 2019 15:04:15
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 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=-1,v;
char r[L];
inline int A()
{
  	int s=0;
  	for(u++;r[u]>47;u++)
  		s=s*10+r[u]-48;
  	return s;
}
inline void S(int x)
{
    if(x<0)
    {
        r[v++]=45,r[v++]=49,r[v++]=32;
        return;
    }
    int i,d=x<10?1:x<100?2:x<1000?3:x<10000?4:x<100000?5:6;
    for(i=d-1;i>=0;x/=10,i--)
        r[v+i]=x%10+48;
    r[v+d]=32,v+=d+1;
}
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);
}