Cod sursa(job #1326894)

Utilizator horiainfoTurcuman Horia horiainfo Data 26 ianuarie 2015 10:07:35
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>
#include <cstdio>
#include <vector>
using namespace std;
ofstream fout("bfs.out");
int a[100001],n,m,s;
struct coada{int nod,pas;}co[100001];
vector<int>nod[100001];
void bfs(int s)
{
    int inc=1,sf=1;
    a[s]=0;
    co[inc].nod=s; co[inc].pas=0;
    while(inc<=sf)
    {
        for(int i=0;i<nod[co[inc].nod].size();i++)
            if(a[nod[co[inc].nod][i]]==-1)
            {
                co[++sf].nod=nod[co[inc].nod][i];
                co[sf].pas=co[inc].pas+1;
                a[nod[co[inc].nod][i]]=co[sf].pas;
            }
        inc++;
    }
}
int main()
{
    int x,y;
    freopen("bfs.in","r",stdin);
    scanf("%d%d%d",&n,&m,&s);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        nod[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        a[i]=-1;
    bfs(s);
    for(int i=1;i<=n;i++)
        fout<<a[i]<<' ';
    return 0;
}