leetcode-go/oj/microsoft-2017/no2/Main.java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt(); // Num of nodes
        int M = sc.nextInt(); // Num of depth
        int K = sc.nextInt(); // Num of leaves
        int[] A = new int[M]; // Num of nodes at depth i
        for (int i = 0; i < M; i++) {
            A[i] = sc.nextInt();
        }
        int[][] num = new int[M][];
        for (int i = 0; i < M; i++) {
            num[i] = new int[A[i]];
            for (int j = 0; j < A[i]; j++) {
                num[i][j] = sc.nextInt();
            }
        }
        int[] L = new int[K];
        for (int i = 0; i < K; i++) {
            L[i] = sc.nextInt();
        }
        int[][] D = new int[K][K];
        for (int i = 0; i < K; i++) {
            for (int j = 0; j < K; j++) {
                D[i][j] = sc.nextInt();
            }
        }
        sc.close();
    }
}