Cod sursa(job #3224073)
Utilizator | Data | 14 aprilie 2024 14:26:10 | |
---|---|---|---|
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,c[100001],i,j,k,d[100000];
vector<int> v[100001];
int main()
{
for(F>>n>>i>>j,c[j]=1,d[k++]=j;F>>i>>j;v[i].push_back(j));
for(i=0;i<k;++i)
for(int j:v[d[i]])
if(!c[j])
c[j]=c[d[i]]+1,d[k++]=j;
for(i=1;i<=n;G<<c[i++]-1<<' ');
return 0;
}