Cod sursa(job #1571704)

Utilizator KONT_testekobol Vasile KONT_teste Data 18 ianuarie 2016 13:26:14
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,i,in,sf,x,y;
vector<int> v[100001];
int c[100001],vc[100001];
int main()
{
f>>n>>m>>s;
for(i=1;i<=m;i++)
    {
     f>>x>>y;
     v[x].push_back(y);
    }
in=sf=1;
c[1]=s;
while(in<=sf)
    {for(i=0;i<v[c[in]].size();i++)
        if(vc[v[c[in]][i]]==0&&v[c[in]][i]!=s)
            {sf++;
            c[sf]=v[c[in]][i];
            vc[v[c[in]][i]]=vc[c[in]]+1;
            }
    in++;
    }
for(i=1;i<=n;i++)
    if(vc[i]==0)
        vc[i]=-1;
vc[s]=0;
for(i=1;i<=n;i++)
    g<<vc[i]<<' ';
g.close();
return 0;
}