Cod sursa(job #3139754)
Utilizator | Data | 1 iulie 2023 13:13:48 | |
---|---|---|---|
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");
vector<int> v[100001];
int i,n,c[100001],q[100001],p,u=1,j,s;
int main()
{
for(F>>n>>i>>s;F>>i>>j;v[i].push_back(j));
for(c[s]=1,q[0]=s;p<u;++p)
for(int j:v[q[p]])
if(!c[j])
c[j]=c[q[p]]+1,q[u++]=j;
for(i=1;i<=n;G<<c[i++]-1<<' ');
return 0;
}