Go: package main

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

func main() {
	scn := bufio.NewScanner(os.Stdin)
	scn.Split(bufio.ScanWords)
	nextInt := func() int { scn.Scan(); r, _ := strconv.Atoi(scn.Text()); return r }
	w := bufio.NewWriter(os.Stdout)

	n := nextInt()
	vecs := make([][]int, n)
	for i := 0; i < n; i++ {
		u := nextInt()
		k := nextInt()
		for j := 0; j < k; j++ {
			vecs[u-1] = append(vecs[u-1], nextInt()-1)
		}
	}

	ds := make([]int, 0, n)
	for i := 0; i < n; i++ {
		ds = append(ds, -1)
	}

	q := make([]int, 0, n)
	q = append(q, 0)
	ds[0] = 0

	for len(q) > 0 {
		i := pop(&q)
		for _, v := range vecs[i] {
			if ds[v] == -1 {
				ds[v] = ds[i]+1
				q = append(q, v)
			}
		}
	}

	for i, d := range ds {
		fmt.Fprintln(w, i+1, d)
	}

	w.Flush()
}

func pop(q *[]int) int {
	v := (*q)[0]
	*q = (*q)[1:]
	return v
}

C++: #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>

using namespace std;

int main(){

  int n;
  cin >> n;

  vector<vector<int>> G(n);

  for(int i=0;i<n;i++){
    int u,k;
    cin >> u >> k;
    for(int j=0;j<k;j++){
      int a;
      cin >> a;
      G[u-1].push_back(a-1);
    }
  }

  vector<int> d(n,-1);
  queue<int> que;

  que.push(0);
  d[0]=0;

  while(!que.empty()){
    int v=que.front();
    que.pop();

    for(int i=0;i<G[v].size();i++){
      if(d[G[v][i]]==-1){
        d[G[v][i]]=d[v]+1;
        que.push(G[v][i]);
      }
    }
  }

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


}

C++: #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;
#define N 100
#define INF 1e9

queue<int> Q;
int n,M[N][N];
int dist[N];

void bsf(int l){
	Q.push(l);
	for(int i = 0;i < n;i++) dist[i] = INF;

	dist[l]=0;
	while(!Q.empty()){
		int u = Q.front();
		Q.pop();
		for(int i=0;i<n;i++){
			if(M[u][i] == 0)continue;
			if(dist[i] != INF)continue;
			dist[i] = dist[u] + 1;
			Q.push(i);
		}
	}

	for(int i=0;i<n;i++){ 
		if(dist[i] == INF)dist = -1;
		
		cout<<i+1<<" "<<dist[i]<<endl;
	}
}


int main(){
	int u,k,v;

	cin >> n;
	for(int i = 0;i < n;i++){
		for(int j = 0;j < n;j++) M[i][j] = 0;
	}

	for(int i = 0;i < n;i++){
		cin >> u >> k;
		u--;
		for(int j = 0;j < k;j++){
			cin >> v;
			v--;
			M[u][v] = 1;
		}
	}
	bsf(0);
	return 0;
}

C++: #include<bits/stdc++.h>
#include<string.h>
#define MAX 101
#define WHITE -1
#define GRAY 2
#define BLACK 1
#define EMPTY -1
#define INF 10000000
using namespace std;

int G[MAX][MAX]={},d[MAX]={},color[MAX]={};
queue<int> Q;

void print(int n){
  for(int i=1;i<n+1;i++){
      if(i!=1&&d[i]==0)cout<<i<<" "<<-1<<endl;
    else cout<<i<<" "<<d[i]<<endl;
  }
}

void bfs(int n,int s){
    int u,v;
    color[s]=GRAY;
    Q.empty();
    Q.push(s);
    while(!Q.empty()){
            u=Q.front();
            Q.pop();
            for (int v = 1; v <= n; ++v) {
                if(G[u][v]&&color[v]==WHITE){
                    color[v]=GRAY;
                    d[v]=d[u]+1;
                    Q.push(v);
                }
            }
            color[u]=BLACK;
        }
}

int main(){
  int n,i,k,j,A,B,V[MAX]={};
  cin>>n;
  for(i=0;i<MAX;i++){
    for(j=0;j<MAX;j++){
        G[i][j]=0;
    }
  }
  for(i=0;i<n;i++){
    cin>>A>>k;
    for(j=0;j<k;j++){
      cin>>B;
      G[A][B]++;
    }
  }

    for(int u=0;u<=n;u++){
        color[u]=WHITE;
        d[u]=0;
    }
  bfs(n,1);
  print(n);
}

C++: #include <bits/stdc++.h>

#define FOR(i, a, b) for(long long int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000 //2000000000
#define LLINF 1000000000000000000 //9000000000000000000
#define PI 3.14159265358979

using namespace std;
typedef long long int ll;
typedef pair< long long int, long long  int> P;

int n;
int u, k, v;
int hour = 0;
int pos;
int d[101];
int gra[101][101] = {};
int color[101] = {};
queue<int>que;



int main(void) {
	cin >> n;
	
	FOR(i, 1, n) {
		cin >> u >> k;
		FOR(t, 1, k) {
			cin >> v;
			gra[u][v] = 1;
		}
	}

	FOR(i, 1, n) {
		d[i] = -1;
	}

	que.push(1);
	d[1] = hour;
	color[1] = 1;
	
	while (que.empty() != 1) {
		pos = que.front();
		que.pop();
		FOR(i, 1, n) {
			if (gra[pos][i] == 1 && color[i] == 0) {
				que.push(i);
				d[i] = d[pos] + 1;
				color[i] = 1;
			}
		}
	}

	FOR(i, 1, n) {
		cout << i << " " << d[i] << endl;
	}
	return 0;
}

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

using namespace std;
static const int N = 100;
static const int INFTY = (1 << 21);

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

void bfs() {
  int u, v;
  queue<int> q;
  d[0] = 0;
  q.push(0);
  while (!q.empty()) {
    u = q.front();
    q.pop();
    for (v = 0; v < n; v++) {
      if (M[u][v] == 0) continue;
      if (d[u] != INFTY) continue;
      q.push(v);
      d[v] = d[u] + 1;
    }
  }
  for (u = 0; u < n; u++) {
    cout << u + 1 << ' ' << ((d[u] == INFTY) ? (-1) : d[u]) << endl;
  }
}

int main() {
  int u, v, k, i, j;

  for (i = 0; i < n; i++) {
    d[i] = INFTY;
  }

  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> u >> k;
    u--;
    for (j = 0; j < k; j++) {
      cin >> v;
      v--;
      M[u][v] = 1;
    }
  }

  bfs();

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using pll=pair<ll,ll>;

#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
vector<vector<int> > G(110, vector<int>());

int main() {
	int N;
	cin >> N;
	int u,k;
	rep(i,N) {
		cin >> u >> k;
		u--;
		G[u] = vector<int>(k);
		rep(j,k) cin >> G[u][j], G[u][j]--;
	}

	queue<int> q;
	vector<int> dist(N, 1e9);
	dist[0] = 0;
	q.push(0);
	while(!q.empty()) {
		int p = q.front();
		q.pop();
		for(auto k : G[p]) {
			if(dist[k] > dist[p] + 1) {
				dist[k] = dist[p] + 1;
				q.push(k);
			}
		}
	}
	rep(i,N) if(dist[i] == 1e9) dist[i] = -1;
	rep(i,N) cout << i+1 << " " << dist[i] << endl;


  return 0;
}

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

using namespace std;

void bfs(vector<vector<int>> matrix) {
	
	//初期化
	//始点からの距離は1次元vectorで管理
	//始点から各頂点への距離をinf(-1)に設定
	int n = matrix.size();
	vector<int> d(n, -1);
	
	//始点をキューに入れる。始点の距離を0に
	queue<int> Q;
	Q.push(0);
	d.at(0) = 0;

	//以下ループ処理で距離の算出
	//キューが空になるまでこのループを回す
	while(! Q.empty()) {
		//キューの先頭の頂点を取り出す
		int head = Q.front();
		Q.pop();
		//その頂点から行ける点について-1なら
		for (int i = 0; i < matrix.at(0).size(); i++) {
			if (matrix[head][i] == 1 && d.at(i) == -1) {
				Q.push(i);
				d.at(i) = d.at(head) + 1;
			}
		}
	}

	// 表示
	for (int j = 0; j < d.size(); j++) {
		cout << j + 1 << " " << d.at(j) << endl;
	}
}

int main(void) {

	//標準入力を受け取る
	int n; //頂点数
	cin >> n;
	vector<vector<int>> matrix(n, vector<int>(n,0)); //隣接行列
	int u, k, v; //頂点番号、出次数、隣接する頂点番号
	for(int i = 0; i < n; i++) {
		cin >> u >> k;
		while(k--) {
			cin >> v;
			matrix.at(u-1).at(v-1) = 1; //有向グラフならこれだけ
			// matrix.at(v-1).at(u-1) = 1; //無向グラフなら反対向きも
		}
	}

	bfs(matrix);
	//
	// 隣接行列の表示
	// for(int i = 0; i < matrix.size(); i++) {
	//	 for(int j = 0 ;j < matrix.at(0).size(); j++) {
	//	 	cout << matrix.at(i).at(j) << " ";
	//	 }
	//	cout << endl;
	// }
}

//隣接リストどうやるの？