Cod sursa(job #2668389)

Utilizator BeraedBeraed Beraed Data 4 noiembrie 2020 20:48:40
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>
#include <vector>
	
using namespace std;
	
ifstream fin("bfs.in");
ofstream fout("bfs.out");
	
int n, m, i, x, y, s, f[100001], c[100001], p, u;
vector <int> v[100001];
	
int main(){
	
    fin>>n>>m>>s;
	
    for(m=m; m--; m>0){
	
        fin>>x>>y;
        v[x].push_back(y);
	
    }
	
    f[s]=1;c[1]=s;
	
    for(p=u=1; p<=u; p++){
	
        int x=c[p];
	
        for(i=0;i<v[x].size();i++){
	
            int y=v[x][i];
	
            if(!f[y]){
	
                c[++u]=y;
                f[y]=f[x]+1;
	
            }
        }
    }
	
    for(i=1;i<=n;i++){
        
        if(i==s)fout<<"0 ";

        else if(f[i]==0)fout<<"-1 ";
	
        else fout<<f[i]-1<<" ";
    }
	
    return 0;
	
}