Cod sursa(job #1001979)

Utilizator ShaDoWsiD100Rzv Rzv ShaDoWsiD100 Data 26 septembrie 2013 17:46:39
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>
#include<vector>
using namespace std;
vector <int> v[100001];
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,i,j,viz[100001],q[100001],nr[100001],p,u,x,y;
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
     {
        f>>x>>y;
        v[x].push_back(y);
     }
     for(i=1;i<=n;i++)
        nr[i]=-1;
     p=u=1;
     q[p]=s;
     viz[s]=1;
     nr[s]=0;
     while(p<=u){
        int k=q[p];
        for(i=0;i<v[k].size();i++)
            if(viz[v[k][i]]==0){
                u++;
                q[u]=v[k][i];
                nr[v[k][i]]=nr[k]+1;
                viz[v[k][i]]=1;

            }
            p++;
       }
      for(i=1;i<=n;i++)
        g<<nr[i]<<" ";
    return 0;
}