Cod sursa(job #863609)

Utilizator vlcmodanModan Valentin vlcmodan Data 23 ianuarie 2013 22:27:03
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>
int x,y,lin[1000000],col[1000000],b[100001],c[100001],i,j,n,m,s;
using namespace std;

int main()
{
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>lin[i]>>col[i];

    }
    x=1;y=1;
    b[1]=s;
    while(x<=y)
    {
        for(i=1;i<=m;i++)
        {
            if(lin[i]==b[x]&&c[col[i]]==0&&col[i]!=lin[i])
            {
                b[++y]=col[i];
                c[col[i]]=c[lin[i]]+1;
            }
        }
		x++;
    }
    for(i=1;i<=n;i++)
		if(i==s)
			g<<0<<" ";
		else
			if(c[i]==0)
				g<<-1<<" ";
		else
    g<<c[i]<<" ";

    return 0;
}