Pagini recente » Cod sursa (job #2708491) | Cod sursa (job #2923011) | Borderou de evaluare (job #2830532) | Cod sursa (job #3174363) | Cod sursa (job #2262062)
#include <fstream>
#include <list>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int dmin[100005];
list<int> q, l[100005];
int main()
{
int n, m, s, i, x, y;
fin >> n >> m >> s;
for(i = 1; i <= m; i++){
fin >> x >> y; l[x].push_back(y);
}
q.push_back(s);
while(!q.empty()){
x = q.front(); q.pop_front();
while(!l[x].empty()){
y = l[x].front();l[x].pop_front();
if(!dmin[y] && y != s)
dmin[y] = dmin[x] + 1;
q.push_back(y);
}
}
for(i = 1; i <= n; i++){
if(i != s && dmin[i] == 0){
fout << -1 << " "; continue;}
fout << dmin[i] << " ";
}
return 0;
}