Cod sursa(job #1379792)

Utilizator bianncaPoenar Bianca biannca Data 6 martie 2015 19:29:29
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <iostream>
#include<fstream>
#include<vector>
#include<queue>
#define mx 100001
#define inf 0x3f3f3f3f
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> v[mx];
int n,m,s,dist[mx];
queue<int> q;
bool viz[mx];
void citire()
{
    int i,x,y;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
}
void bfs(int s)
{
    q.push(s);
    viz[s]=true;
    dist[s]=0;
    while(!q.empty())
    {
        s=q.front();
        q.pop();
        for(unsigned int i=0;i<v[s].size();++i)
        if(viz[v[s][i]]==false)
        {
            dist[v[s][i]]=dist[s]+1;
            viz[v[s][i]]=true;
            q.push(v[s][i]);
        }
    }
}
int main()
{
    int i;
    citire();
    for(i=1;i<=n;i++)
        dist[i]=inf;
    bfs(s);
    for(i=1;i<=n;i++)
        if(dist[i]!=inf)
        fout<<dist[i]<<" ";
    else fout<<"-1 " ;
    return 0;
}