Cod sursa(job #3121922)
Utilizator | Data | 16 aprilie 2023 09:58:19 | |
---|---|---|---|
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 n,m,s,i,j,p,u,q[100001],c[100001];
int main()
{
for(F>>n>>m>>s;F>>i>>j;v[i].push_back(j));
for(c[s]=1,q[u++]=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;
}