Cod sursa(job #694767)

Utilizator bacilaBacila Emilian bacila Data 27 februarie 2012 23:37:20
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include <vector>
#include <fstream>
#include<queue>
#define pb(x) push_back(x)
using namespace std;
vector<int> v[100005];
queue<int> q,w;
int n,m,i,s,x,y,viz[100005];
int main ()
{ifstream f("bfs.in");
 ofstream g("bfs.out");
f>>n>>m>>s;
while(m)
{f>>x>>y;
v[x].pb(y);
m--;}
viz[s]=-1;

for(i=0;i<v[s].size();i++)
if(!viz[v[s][i]])
{viz[v[s][i]]=1;
q.push(v[s][i]);
w.push(1);}
while(!q.empty())
{for(i=0;i<v[q.back()].size();i++)
if(!viz[v[q.back()][i]])
{viz[v[q.back()][i]]=w.back()+1;
q.push(v[q.back()][i]);
w.push(w.back()+1);}
q.pop();
w.pop();                 
}
for(i=1;i<=n;i++)
if(viz[i]==-1)
g<<0<<" ";
else
if(!viz[i])
g<<-1<<" ";
else
g<<viz[i]<<" ";
 f.close(); g.close();
return 0;
}