Cod sursa(job #1365979)

Utilizator bianncaPoenar Bianca biannca Data 28 februarie 2015 17:27:16
Problema BFS - Parcurgere in latime Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include<fstream>
#include<vector>
#include<queue>
#define mx 100000
using namespace std;
ifstream fin("bfs.in");
ofstream gout("bfs.out");
vector<int> v[mx],d;
queue<int> q;
vector<bool> viz;
//int viz[mx];
int n,m,s;
void citire()
{
    int i,x,y;
    fin>>n>>m>>s;
    viz.resize(n+1);
    d.resize(n+1,-1);
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    //fin.close();
}
void bfs(int x)
{
    q.push(x);
    viz[x]=true;
    d[x]=0;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(unsigned int i=0;i<v[x].size();++i)
        if(!viz[v[x][i]])
        {
            viz[v[x][i]]=true;
            q.push(v[x][i]);
            d[v[x][i]]=d[x]+1;
        }

    }
}
int main()
{
    int i;
    citire();
   // for(i=1;i<=n;i++)
     //   d[i]=-1;
    bfs(s);
    for(i=1;i<=n;i++)
        gout<<d[i]<<" ";
    return 0;
}