Cod sursa(job #2949345)
Utilizator | Data | 30 noiembrie 2022 14:28:18 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("bfs.in");
ofstream G("bfs.out");
vector<int> l[100001];
int v[100001],c[100001],n,p,u,s,x,y;
int main()
{
for(F>>n>>x>>s;F>>x>>y;l[x].push_back(y));
for(v[s]=p=u=1,c[1]=s;p<=u;++p)
for(auto a:l[c[p]])
if(!v[a])
c[++u]=a,v[a]=v[c[p]]+1;
for(p=1;p<=n;G<<v[p++]-1<<' ');
return 0;
}