6 задача

//формат ввода длина, массив смежности, начальная точка
//5
//0 1 0 0 1
//1 0 1 0 0
//0 1 0 0 0
//0 0 0 0 0
//1 0 0 0 0
//4
//4 // Точка
//0 // Длина

//5
//0 1 0 0 1
//1 0 1 0 0
//0 1 0 0 0
//0 0 0 0 0
//1 0 0 0 0
//3
//5 // Точка
//3 // Длина


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

using namespace std;

void BFS(const vector<vector<int>>& array,const int& start, vector<int>& distance)
{
    queue<int> Q;
    vector<int> parent(array.size(),-2);

    parent[start-1] = -1;
    distance[start-1] = 0;
    Q.push(start-1);
    int vr;
    while(Q.size()) {
        vr=Q.front();
        Q.pop();
        for (int i = 0; i < array.size(); i++)
        {
            if (array[vr][i] == 1)
            {
                if (distance[i] == -1)
                {
                    Q.push(i);
                    parent[i]=vr;
                    distance[i] = distance[vr] + 1;
                }
            }
        }
    }
}
int  main() {

    int32_t         lenght;
    int32_t         start;
    int32_t         max=0;
    int32_t         number;
    cin >> lenght;

    vector<int> distance(lenght, -1);

    vector<vector<int>>  array(lenght);
    for(int i =0; i < lenght; i++) {
        array[i].resize(lenght);
        for (int j = 0; j < lenght; ++j) {
            cin >> array[i][j];
        }
    }

    cin >> start;
    number =start;
    BFS(array,start,distance);

    for(int i=0;i<lenght;i++)
    {
        if(distance[i]>max)
        {
            number=i+1;
            max=distance[i];
        }
    }
    cout << number << endl << max;

}