Cod sursa(job #1116792)

Utilizator FasinedJohnny Bravo Fasined Data 22 februarie 2014 20:19:43
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include<fstream>
#include<vector>
#include<deque>
#define nx 100007
using namespace std;
int n,m,i,s,x,y,dist[nx];
vector<int>v[nx];
deque<int>d;

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

void bfs()
{
    d.push_back(s);
    dist[s]=1;
    while(!d.empty())
    {
        x=d.front(),d.pop_front();
        for(i=0;i<v[x].size();i++)
        if(!dist[v[x][i]])
        {
            dist[v[x][i]]=dist[x]+1;
            d.push_back(v[x][i]);
        }
    }
}


int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs();
    for(i=1;i<=n;i++)fout<<dist[i]-1<<' ';
    return 0;
}