Go: package main

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

type AdjacentList struct {
	matrix [][]int
}

func NewEmptyAdjacentList(dim int) *AdjacentList {
	matrix := make([][]int, dim)
	for i := 0; i < dim; i++ {
		matrix[i] = make([]int, dim)
	}
	return &AdjacentList{matrix: matrix}
}

func (al *AdjacentList) set(node int, adjacent int) {
	al.matrix[node-1][adjacent-1] = 1
}

func (al *AdjacentList) findAdjacentsFor(node int) []int {
	adjacents := []int{}
	for i, v := range al.matrix[node-1] {
		if v == 1 {
			adjacents = append(adjacents, i+1)
		}
	}
	return adjacents
}

type DistanceList struct {
	list []int
}

func NewDistanceList(dim int) *DistanceList {
	list := make([]int, dim)
	for i := 0; i < dim; i++ {
		list[i] = -1
	}
	return &DistanceList{list: list}
}

func (dl *DistanceList) set(node int, distance int) {
	dl.list[node-1] = distance
}

func (dl *DistanceList) get(node int) int {
	return dl.list[node-1]
}

func (dl *DistanceList) isVisited(node int) bool {
	return dl.list[node-1] >= 0
}

type Position struct {
	node     int
	distance int
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	dim, err := nextInt(sc)
	if err != nil {
		panic(err)
	}

	al := NewEmptyAdjacentList(dim)

	for i := 1; i <= dim; i++ {
		node, err := nextInt(sc)
		if err != nil {
			panic(err)
		}

		adjacentNum, err := nextInt(sc)
		if err != nil {
			panic(err)
		}
		for j := 0; j < adjacentNum; j++ {
			adjacent, err := nextInt(sc)
			if err != nil {
				panic(err)
			}
			al.set(node, adjacent)
		}
	}

	dl := NewDistanceList(dim)

	bfs(al, dl)

	for i := 1; i <= dim; i++ {
		fmt.Printf("%d %d\n", i, dl.get(i))
	}
}

func bfs(al *AdjacentList, dl *DistanceList) {
	stack := []Position{Position{node: 1, distance: 0}}
	for len(stack) > 0 {
		currentPosition := stack[0]
		stack = stack[1:]
		if !dl.isVisited(currentPosition.node) {
			dl.set(currentPosition.node, currentPosition.distance)
		}
		for _, v := range al.findAdjacentsFor(currentPosition.node) {
			stack = append(stack, Position{node: v, distance: currentPosition.distance + 1})
		}
	}
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>

using namespace std;

#define WHITE 0
#define GRAY 1
#define BLACK 2

static const int N = 100;
static const int FAR = (1 << 21);

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] = FAR;
	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] != FAR) continue;
			d[v] = d[u] + 1;
			q.push(v);
		}
	}
	for (int i = 0; i < n; ++i)
		cout << i + 1 << " " << ((d[i] == FAR) ? -1 : d[i]) << endl;
}

int main(){
	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) {
		int u, d, v; cin >> u >> d;
		for (int j = 0; j < d; ++j) {
			cin >> v;
			M[u - 1][v - 1] = 1;
		}
	}

	bfs(0);

	return 0;
}

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

#define REP(i, n) for(int i = 0; i < n; i++)
using namespace std;

int main()
{   
    /* 座席　（中央×後）*/
    //資料の説明通りにやってみたつもりです

    int n;
    cin >> n;
    vector<vector<int>> edges(n, vector<int>());

    REP(i, n) {
        int u, k, e;
        cin >> u >> k;

        REP(j, k) {
            cin >> e;
            edges.at(u-1).push_back(e-1);
        }
    }

    queue<int> Q;
    vector<int> dst(n, 1000000);

    dst[0] = 0;
    Q.push(0);

    while (!Q.empty()) {
        int cur = Q.front();
        Q.pop();

        REP(i, edges[cur].size()) {
            if (dst[edges[cur][i]] == 1000000)
                Q.push(edges[cur][i]);
                if (dst[edges[cur][i]] > dst[cur]+1)
                    dst[edges[cur][i]] = dst[cur]+1;
        }
    }

    REP(i, n) {
        if (dst[i] == 1000000)
            cout << i+1 << " " << -1 << endl;
        else 
            cout << i+1 << " " << dst[i] << endl;
    }
}

C++: #include <iostream>
#include <queue>
#define N 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
using namespace std;
int m[N][N],color[N],d[N],n;



void bfs(int s){
	
	queue<int> q;
	q.push(s);
	for(int i=0;i<N;i++){
		color[i] = WHITE;
		d[i] = (1<<21);
	}
	d[s] = 0;
	color[s] = GRAY;
	int u;
	while(!q.empty()){
		u = q.front();
		q.pop();
		
		for(int v=0;v<n;v++){
			if(m[u][v]&&color[v]==WHITE){
				color[v] = GRAY;
				d[v] = d[u]+1;
				q.push(v);
			}
		}
	}
	for(int i=0;i<n;i++){
			cout<<i+1<<" "<<((d[i]==(1<<21))?(-1):(d[i]))<<endl; 
		}
}
	
	int main(){
		int u,v,k;
		
		cin>>n;
		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;
			}
		}
		bfs(0);
		
		return 0;
}

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);
		}
	}
}

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 <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>

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

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] = INFTY;
    }
    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] != INFTY){
                continue;
            }
            d[v] = d[u] + 1;
            q.push(v);
        }
    }
    for (int i=0;i<n;i++){
        cout << i+1 << " " << ((d[i]==INFTY) ? (-1) : d[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;
        }
    }

    bfs(0);

}