Cod sursa(job #1053094)

Utilizator fred1fred fred fred1 Data 12 decembrie 2013 10:52:18
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <fstream>
#include<vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int>G[100005];
int D[100005],c[100005],n,m,s;
bool use[100005];
int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }


    c[1]=s;int k=1;
    use[s]=1;
    for(int i=1;i<=k;i++)
    {
        int nod=c[i];
        for(unsigned int j=0;j<G[nod].size();j++)
        {
            int vecin=G[nod][j];
            if(!use[vecin])
            {
                c[++k]=vecin;
                D[vecin]=D[nod]+1;
                use[vecin]=1;

            }
        }
    }
    for(int i=1;i<=n;i++)
    if(D[i]==0&&i!=s)
    fout<<-1<<" ";
    else
    fout<<D[i]<<" ";


    return 0;
}