Cod sursa(job #1438175)

Utilizator alexandra_udristoiuUdristoiu Alexandra Maria alexandra_udristoiu Data 19 mai 2015 10:23:42
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include<fstream>
#include<vector>
using namespace std;
int n, m, i, p, u, x, y, s;
int viz[100002], cost[100002], c[100002];
vector<int> v[100002];
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int main(){
    fin>> n >> m >> s;
    for(i = 1; i <= m; i++){
        fin>> x >> y;
        v[x].push_back(y);
    }
    for(i = 1; i <= n; i++){
        cost[i] = -1;
    }
    p = u = 1;
    c[1] = s;
    cost[s] = 0;
    viz[s] = 1;
    while(p <= u){
        for(i = 0; i < v[c[p]].size(); i++){
            if(viz[v[c[p]][i]] == 0){
                viz[v[c[p]][i]] = 1;
                u++;
                c[u] = v[c[p]][i];
                cost[v[c[p]][i]] = cost[c[p]] + 1;
            }
        }
        p++;
    }
    for(i = 1; i <= n; i++){
        fout<< cost[i] <<" ";
    }
    return 0;
}