Cod sursa(job #1193342)

Utilizator bogdanmarin69Bogdan Marin bogdanmarin69 Data 31 mai 2014 14:46:04
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <cstdio>
#include <vector>
using namespace std;
#define MAX 100001
vector <int> vad[MAX];
int n, m, s, v[MAX], prim=1, ult=1, timp[MAX];
int main()
{
    int i, source, dest;
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    scanf("%d%d%d", &n, &m, &s);
    for(i=1; i<=m; i++){
        scanf("%d%d", &source, &dest);
        vad[source].push_back(dest);
    }
    for(i=1; i<=n; i++) timp[i]=-1;
    v[1] = s; timp[s] = 0;
    while(prim<=ult){
        vector <int>::iterator it;
        for(it=vad[v[prim]].begin(); it<vad[v[prim]].end(); it++)
            if(timp[*it]==-1){
                timp[*it] = timp[v[prim]]+1;
                v[++ult] = *it;
            }
        prim++;
    }
    for(i=1; i<=n; i++)
        printf("%d ", timp[i]);
    return 0;
}