Timus-1837. Isenbaev's Number

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
//#include <unordered_set>
//#include <unordered_map>
#include <queue>
//#include <ctime>
//#include <cassert>
//#include <complex>
#include <string>
#include <cstring>
//#include <chrono>
//#include <random>
#include <bitset>
using namespace std;
//using namespace chrono;
#define pb push_back
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define F first
#define S second
typedef long long ll;
typedef vector< int > vi;
typedef vector< ll > V;
typedef map<int, int > mp;
#define debug cout << -1 << endl;
#define REP(i, a, b) for(int i=a; i<b; i++)
#define f0r(i, n) for (int i = 0; i < n; ++i)
#define fore(a, x) for (auto& a : x)
#define fori(i, a, b) for (int i = (a); i < (b); ++i)
//#define pop pop_back
#define sz(a) (int)a.size()
//#define fin cin
//#define fout cout
const ll MOD = 1000000007;
const int INF = (int)1e9;
int dx[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int dy[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const double PI = acos(-1.0);
const double diff = 1e-6;

bool vis[305];
int dist[305];
vector< int > v[305];
map< string, int > m;

void bfs(int src)
{
    dist[src] = 0;
    queue< int > q;
    q.push(src);
    vis[src] = true;
    while(!q.empty()) {
        int x = q.front();
        q.pop();
        for(auto zz: v[x]) {
            if(!vis[zz]) {
                vis[zz] = true;
                dist[zz] = dist[x]+1;
                q.push(zz);
            }
        }
    }
}

void solve()
{
    int n;
    cin >> n;
    memset(dist, -1, sizeof(dist));
    int cnt = 1;
    set< string > s;
    for(int i=0; i<n; i++) {
        string a, b, c;
        cin >> a >> b >> c;
        s.insert(a);
        s.insert(b);
        s.insert(c);
        if(!m[a]) m[a] = cnt++;
        if(!m[b]) m[b] = cnt++;
        if(!m[c]) m[c] = cnt++;
        v[m[a]].pb(m[b]);
        v[m[b]].pb(m[a]);
        v[m[a]].pb(m[c]);
        v[m[c]].pb(m[a]);
        v[m[b]].pb(m[c]);
        v[m[c]].pb(m[b]);
    }
    bfs(m["Isenbaev"]);
    for(auto x: s) {
        cout << x << " ";
        if(dist[m[x]]!=-1) cout << dist[m[x]] << "\n";
        else cout << "undefined" << "\n";
    }
}

int main()
{
    int t;
    t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}