Hackerrank-Leetcode/BFS_shortReach.cpp at master · skanda99/Hackerrank-Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76

// problem: "https://www.hackerrank.com/challenges/bfsshortreach/problem"

#include<iostream>
#include<vector>
#include<queue>

using namespace std;

void BFS(vector<int>G[],int n,int s)
{
    queue<int>Q;
    vector<int>V(n+1,-1);
    Q.push(s);

    V[s] = 0;
    while(!Q.empty())
    {
        int i = Q.front();
        Q.pop();

        int j;
        for(j=0;j!=G[i].size();j++)
        {
            if(V[G[i][j]]==-1)
            {
                V[G[i][j]] = V[i]+1;
                Q.push(G[i][j]);
            }
        }
    }

    int i;
    for(i=1;i!=n+1;i++)
    {
        if(i!=s)
        {
            if(V[i]==-1)
                cout<<-1<<' ';
            else
                cout<<V[i]*6<<' ';
        }
    }

    cout<<'\n';
}

int main()
{
    int q;
    cin>>q;

    while(q--)
    {
        int n,m;

        cin>>n>>m;
        vector<int>G[n+1];

        int x,y;
        while(m--)
        {
            cin>>x>>y;

            G[x].push_back(y);
            G[y].push_back(x);
        }

        int s;
        cin>>s;

        BFS(G,n,s);       // define
    }

    return 0;
}