Cod sursa(job #2492978)

Utilizator vali_27Bojici Valentin vali_27 Data 15 noiembrie 2019 19:00:40
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.9 kb
#include <bits/stdc++.h>

using namespace std;

vector <vector <int > >la;
vector <int>::iterator it;
int n,m,s;

FILE *fin = fopen("bfs.in","r");
FILE *fout = fopen("bfs.out","w");

void citire()
{
    fscanf(fin,"%d %d %d",&n,&m,&s);
    la.resize(n+1);
    int x,y;
    for(int i=1;i<=m;++i)
    {
        fscanf(fin,"%d %d",&x,&y);
        la[x].push_back(y);
    }
}

void bfs()
{
    vector <int> used;
    queue <int> q;
    used.resize(n+1);
    used.clear();

    q.push(s);
    used[s] = 1;

    while(!q.empty())
    {
        int v = q.front();
        q.pop();
        for(it = la[v].begin();it!=la[v].end();++it)
        {
            if(used[*it] != 0)continue;
            used[*it] = 1 + used[v];
            q.push(*it);
        }
    }

    for(int i=1;i<=n;++i)
        fprintf(fout,"%d ",used[i]-1);
}



int main()
{
    citire();
    bfs();
}