Cod sursa(job #1428556)

Utilizator GrecuDianaSorinaGrecu Diana-Sorina GrecuDianaSorina Data 4 mai 2015 19:07:49
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
# include<fstream>
# include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int i,n,m,x,y,nr[1001],c[1001],s;
bool viz[1001];
vector <int> a[1001];
void bfs(int k)
{
    int i,p,u, z;
    viz[k]=1;
    c[1]=k;
    nr[k]=0;
    p=u=1;
    while(p <= u)
    {
        y=c[p];
        for(i=0;i< a[y].size();i++)
        {
            z = a[y][i];
            if(viz[z]==0)
            {
                u++;
                c[u]=z;
                nr[z]=nr[y]+1;
                viz[z]=1;
            }
        }
        p++;
    }
}
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++)
    {
        if(viz[i]==0) nr[i]=-1;
    }
    for(i=1;i<=n;i++)
        g<<nr[i]<<" ";
    return 0;
}