Cod sursa(job #3004827)
Utilizator | Data | 16 martie 2023 17:16:26 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("bfs.in");
ofstream G("bfs.out");
int n,i,j,k,c[100001],s,q[100001],u,w;
vector<int> v[100001];
int main()
{
for(F>>n>>i>>s;F>>i>>j;v[i].push_back(j));
for(c[s]=1,q[w++]=s;u<w;++u)
for(auto a:v[q[u]])
if(!c[a])
c[a]=c[q[u]]+1,q[w++]=a;
for(i=1;i<=n;G<<c[i++]-1<<' ');
return 0;
}