Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var distance []int

type queue struct {
	q    []int
	head int
	tail int
}

func (q *queue) push(n int) {
	q.q[q.tail] = n
	q.tail++
}

func (q *queue) pop() int {
	q.head++
	return q.q[q.head-1]
}

func (q *queue) isEmpty() bool {
	return q.head == q.tail
}

func makeAdjList() [][]int {
	var n int
	fmt.Scanf("%d", &n)

	adj := make([][]int, n)
	for i := 0; i < n; i++ {
		adj[i] = make([]int, n)
	}

	sc := bufio.NewScanner(os.Stdin)
	for i := 0; i < n; i++ {
		sc.Scan()
		nodeInfo := strings.Split(sc.Text(), " ")
		outDegree, _ := strconv.Atoi(nodeInfo[1])

		if outDegree > 0 {
			for k := 0; k < outDegree; k++ {
				j, _ := strconv.Atoi(nodeInfo[k+2])
				j-- // convert 1 based to 0 based
				adj[i][j] = 1
			}
		}
	}

	return adj
}

func bfs(graph [][]int, s int) {
	distance = make([]int, len(graph))

	infty := -1
	for i := 0; i < len(distance); i++ {
		distance[i] = infty
	}
	distance[s] = 0

	q := &queue{make([]int, 1000), 0, 0}
	q.push(s)

	for !q.isEmpty() {
		u := q.pop()
		for i := 0; i < len(graph); i++ {
			if graph[u][i] == 0 {
				continue // u, i間に辺がない場合
			}
			if distance[i] != infty {
				continue // 訪問済みの場合
			}
			// 訪問するnodeの始点からの距離を設定し、訪問キューに入れる
			distance[i] = distance[u] + 1
			q.push(i)
		}
	}

	// print distance
	for i, d := range distance {
		fmt.Printf("%d %d\n", i+1, d)
	}
}

func main() {
	adj := makeAdjList()
	bfs(adj, 0)
}

C++: #include <iostream>
#include <queue>

using namespace std;

typedef pair<int, int> E;

int INF = 100000000;

int main() {
  int n, u, k;
  cin >> n;
  int** G = new int*[n+1];
  for (int i = 0; i < n; i++) {
    cin >> u >> k;
    G[u] = new int[k+1];
    G[u][0] = k;
    for (int j = 1; j <= k; j++) {
      cin >> G[u][j];
    }
  }

  int cnt = 0;
  int* visit = new int[n+1];
  for (int i = 1; i <= n; i++) {
    visit[i] = INF;
  }

  queue<E> q;
  q.push(E(1, cnt));
  while (q.size()) {
    E e = q.front();
    q.pop();
    if (visit[e.first] != INF)
      continue;
    visit[e.first] = e.second;

    int len = G[e.first][0];
    for (int i = 1; i <= len; i++) {
      q.push(E(G[e.first][i], e.second + 1));
    }
  }

  for (int i = 1; i <= n; i++) {
    cout << i << " " << visit[i] << endl;
  }
  return 0;
}

C++: /* ALDS1_11_C: Breadth First Search */

#include <iostream>
#include <vector>
#include <queue>
using std::vector;
using std::queue;

// 頂点0から各頂点への最短距離を paths に格納する。
void minimum_paths(int n_v, vector<int> graph[], int paths[]) {
    queue<int> visits;
    int found[n_v];
    std::fill_n(found, n_v, 0);
    found[0] = 1;

    visits.push(0);
    while(! visits.empty()) {
        int id = visits.front();
        visits.pop();
        vector<int> adjs = graph[id];
        for (int i = 0; i < adjs.size(); i++) {
            int adj = adjs[i];
            if (! found[adj]) {
                found[adj] = 1;
                paths[adj] = paths[id] + 1;
                visits.push(adj);
            }
        }
    }

    // 辿りつけなかった頂点までの距離は -1 とする。
    for (int i = 1; i < n_v; i++) {
        if (paths[i] == 0) {
            paths[i] = -1;
        }
    }
}

int main() {
    std::ios::sync_with_stdio(false);

    int n_v;
    std::cin >> n_v;

    int id, adj, n_adjs;
    vector<int> *graph = new vector<int>[n_v];
    for (int i = 0; i < n_v; i++) {
        std::cin >> id >> n_adjs;
        for (int j = 0; j < n_adjs; j++) {
            std::cin >> adj;
            graph[id - 1].push_back(adj - 1);
        }
    }

    int paths[n_v];
    std::fill_n(paths, n_v, 0);
    minimum_paths(n_v, graph, paths);

    for (int i = 0; i < n_v; i++) {
        std::cout << i + 1 << " " << paths[i] << "\n";
    }
    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;

#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define Repr(e, b, i) for(int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n-1, i)
#define repr(n, i) Repr(n-1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(v) push_back(v)
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define bitcnt(x) __builtin_popcount(x)
#define fst first
#define snd second
#define Pqaz(T) priority_queue<T,vector<T>,greater<T>>
#define Pqza(T) priority_queue<T>
#define ENJYU std::ios::sync_with_stdio(false);std::cin.tie(0);

typedef long long ll;
typedef pair<ll, ll> llP;
typedef pair<int, int> intP;

//vector の中身を出力
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}

const int MAX = 128;

vector <int> adj[MAX];
int d[MAX];

void solve(void){
	ENJYU;
	int N;
	cin >> N;
	rep(N, i) {
		int u, k;
		cin >> u >> k;
		u--;
		rep(k, i) {
			int v;
			cin >> v;
			v--;
			adj[u].pb(v);
		}
	}
	memset(d, -1, sizeof(d));
	queue <int> q;
	q.push(0);
	d[0] = 0;
	while (!q.empty()) {
		int n = q.front();
		q.pop();
		for (int nv : adj[n]) {
			if (d[nv] >= 0) {
				//d[nv] = min(d[nv], d[n] + 1);
				continue;
			}
			d[nv] = d[n] + 1;
			q.push(nv);
		}
	}

	rep(N, i) cout << i+1 << ' ' << d[i] << endl;

}

int main(void){
	solve();
	//cout << "yui(*-v・)yui" << endl;
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;

const int N =100;
const int inf = 0x3f3f3f3f;

int n, M[N][N];
int d[N];

void bfs(int s){
    queue<int> q;
    q.push(s);
    for(int i=0;i<n;i++) d[i] = inf;
    d[s] = 0;
    int u;
    while(!q.empty()){
        u = q.front();q.pop();
        for(int v=0;v<n;v++){
            if(M[u][v]==0) continue;
            if(d[v]!=inf) continue;
            d[v] = d[u]+1;
            q.push(v);
        }
    }
}

int main(){
    //freopen("a.txt","r",stdin);
    int u,v,k;
    memset(M,0,sizeof(M));
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&u);
        u--;
        scanf("%d",&k);
        for(int j=0;j<k;j++){
            scanf("%d",&v);
            v--;
            M[u][v] = 1;
        }
    }
    bfs(0);
    for(int i=0;i<n;i++){
        printf("%d %d\n",i+1,d[i]);
    }
    return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
using namespace std;

#define MAX 100

int d[MAX], t = 0, M[MAX][MAX] = {}, n;

void bfs(){
    queue<int> todo;
    d[0] = 0;
    todo.push(0);
    while(!todo.empty()){
        int m = todo.front();
        todo.pop();
        rep(i, n){
            if(d[i] == -1 && M[m][i]){
                d[i] = d[m] + 1;
                todo.push(i);
            }
        }
    }
    return;
}

int main(){
    cin >> n;
    fill(d, d + n, -1);
    int m, l;
    rep(i, n){
        cin >> m >> l;
        rep(j, l){
            int o;
            cin >> o;
            M[m - 1][o - 1] = 1;
        }
    }
    bfs();
    rep(i, n){
        cout << i + 1 << " " << d[i] << endl;
    }
    
    return 0;
}