Cod sursa(job #1505511)

Utilizator altcinevaRobert altcineva Data 19 octombrie 2015 12:04:22
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;

vector<int>b[100001];

ifstream fin ("bfs.in");
ofstream fout ("bfs.out");

int c[100001],n,viz[100001];
void bf(int x)
{
    int p,u,z,w,j;
    p=u=1;
    c[1]=x;
    viz[x]=1;
    while(p<=u)
    {
        z=c[p];p++;
        for(j=0;j<b[z].size();j++)
        {
            w=b[z][j];
            if (!viz[w]){u++; c[u]=w; viz[w]=viz[z]+1;}
        }
    }
}
int main()
{
    int i,x,y,m,s;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        b[x].push_back(y);
    }
    bf(s);
    for(i=1;i<=n;i++)fout<<viz[i]-1<<" ";
    return 0;
}