Problem:
Rooted Trees

A graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).

Fig. 1

A free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called "node."

Your task is to write a program which reports the following information for each node u of a given rooted tree T:

node ID of u

parent of u

depth of u

node type (root, internal node or leaf)

a list of chidlren of u

If the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.

A node with no children is an external node or leaf. A nonleaf node is an internal node

The number of children of a node x in a rooted tree T is called the degree of x.

The length of the path from the root r to a node x is the depth of x in T.

Here, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.

Fig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.

Fig. 2

Input

The first line of the input includes an integer n, the number of nodes of the tree.

In the next n lines, the information of each node u is given in the following format:

id k c1 c2 ... ck

where id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.

Output

Print the information of each node in the following format ordered by IDs:

node id: parent = p, depth = d, type, [c1...ck]

p is ID of its parent. If the node does not have a parent, print -1.

d is depth of the node.

type is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.

c1...ck is the list of children as a ordered tree.

Please follow the format presented in a sample output below.

Constraints

1 ≤ n ≤ 100000

Sample Input 1

13
0 3 1 4 10
1 2 2 3
2 0
3 0
4 3 5 6 7
5 0
6 0
7 2 8 9
8 0
9 0
10 2 11 12
11 0
12 0

Sample Output 1

node 0: parent = -1, depth = 0, root, [1, 4, 10]
node 1: parent = 0, depth = 1, internal node, [2, 3]
node 2: parent = 1, depth = 2, leaf, []
node 3: parent = 1, depth = 2, leaf, []
node 4: parent = 0, depth = 1, internal node, [5, 6, 7]
node 5: parent = 4, depth = 2, leaf, []
node 6: parent = 4, depth = 2, leaf, []
node 7: parent = 4, depth = 2, internal node, [8, 9]
node 8: parent = 7, depth = 3, leaf, []
node 9: parent = 7, depth = 3, leaf, []
node 10: parent = 0, depth = 1, internal node, [11, 12]
node 11: parent = 10, depth = 2, leaf, []
node 12: parent = 10, depth = 2, leaf, []

Sample Input 2

4
1 3 3 2 0
0 0
3 0
2 0

Sample Output 2

node 0: parent = 1, depth = 1, leaf, []
node 1: parent = -1, depth = 0, root, [3, 2, 0]
node 2: parent = 1, depth = 1, leaf, []
node 3: parent = 1, depth = 1, leaf, []

Note

You can use a left-child, right-sibling representation to implement a tree which has the following data:

the parent of u

the leftmost child of u

the immediate right sibling of u

Reference

Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.

Solution in C (judge verdict: Time Limit Exceeded)


#include <stdio.h>
#include <stdlib.h>

#define NOT_FOUND -1
#define SENTINEL 100001



typedef struct Node_ {
    int id; // id of current node
    int nChildren; // number of children
    int * children; // id of children are stored here
    struct Node_ * parentPointer; // parent pointers are stored here
} Node;

void printArray(int array[], int length) {
    for (int i = 0; i < length; i++) {
        if (i) printf(", ");
        printf("%d", array[i]);
    }
}


void swap(Node Array[], int i, int j) {
    Node temp;
    temp = Array[i];
    Array[i] = Array[j];
    Array[j] = temp;
}

int partition(Node Array[], int pIndex, int rIndex) {
    Node x = Array[rIndex];
    int i = pIndex;
    
    for (int j = pIndex; j < rIndex; j++)
        if (Array[j].id <= x.id)
            swap(Array, i++, j);

    swap(Array, i, rIndex);
    return i;
}

void quickSort(Node Array[], int pIndex, int rIndex) {
    if (pIndex < rIndex) {
        int qIndex = partition(Array, pIndex, rIndex);
        quickSort(Array, pIndex, qIndex - 1);
        quickSort(Array, qIndex + 1, rIndex);
    }
}




void merge(Node array[], int left, int mid, int right) {
    int nL = mid - left;
    int nR = right - mid;
    
    Node Left[nL + 1], Right[nR + 1];
    int i, j, k;
    
    for (i = 0; i < nL; i++)  Left[i] = array[left + i];
    for (j = 0; j < nR; j++) Right[j] = array[mid  + j];
    
    Left[nL].id = Right[nR].id = SENTINEL;
    
    for (i = 0, j = 0, k = left; k < right; k++) {
        if (Left[i].id < Right[j].id) 
            array[k] = Left[i++];
        else 
            array[k] = Right[j++];
    }
}

void mergeSort(Node array[], int left, int right) {
    if (left + 1 < right) {
        int mid = (left + right)/2;
        mergeSort(array, left, mid);
        mergeSort(array, mid, right);
        merge(array, left, mid, right);
    }
}
















int findArrayIndexWithValue(int array[], int length, int value) {
    for (int i = 0; i < length; i++)
        if (array[i] == value)
            return i;
    return NOT_FOUND;
}

int findNodeIndexWithId(Node nodes[], int length, int nodeId) {
    for (int i = 0; i < length; i++)
        if (nodes[i].id == nodeId)
            return i;
    return NOT_FOUND;
}

int findNodeIndexWithChildren(Node nodes[], int length, int cId) {
    for (int i = 0, j; i < length; i++) {
        if (nodes[i].id == cId)
            continue;
        
        j = findArrayIndexWithValue(nodes[i].children, nodes[i].nChildren, cId);
        
        if (j != NOT_FOUND)
            return i;
    }
    return NOT_FOUND;
}

int depth(Node node) {
//    printf("depth");
    int i = 0;
    while (node.parentPointer->id != -1) {
        i++;
        
        if (node.parentPointer == NULL)
            break;
        
//        printf("node.parentPointer: %p\n", node.parentPointer);
        node = *(node.parentPointer);
//        printf("*(node.parentPointer).id: %d\n", node.id);
    }
    return i;
}

int main(int argc, char** argv) {
    int nNodes, nChildren;
    scanf("%d", &nNodes);
//    printf("\n   (nn: %2d)\n", nNodes);
    
    Node nodes[nNodes];
    int i, j;
    
    for (i = 0; i < nNodes; i++) {
        scanf("%d", &(nodes[i].id)); // id
//        printf("%2d", nodes[i].id);
        scanf("%d", &(nodes[i].nChildren)); // k, number of children
//        printf(" (nc: %2d) =>", nodes[i].nChildren);
        
        if (nodes[i].nChildren > 0)
            nodes[i].children = (int *)malloc(nodes[i].nChildren * sizeof(int));
        
        for (j = 0; j < nodes[i].nChildren; j++) {
            scanf("%d", &(nodes[i].children[j]));
//            printf(" %d", nodes[i].children[j]);
        }
//        printf("\n");
    }
    
    Node root;
    root.id = -1;
    int parentIndex;
    
//    mergeSort(nodes, 0, nNodes);
    quickSort(nodes, 0, nNodes - 1);
    
//    printf("--------\n");
//    for (i = 0; i < nNodes; i++) {
//        printf("%2d", nodes[i].id);
//        printf(" (nc: %2d) =>", nodes[i].nChildren);
//        
//        for (j = 0; j < nodes[i].nChildren; j++) {
//            printf(" %d", nodes[i].children[j]);
//        }
//        printf("\n");
//    }
    
    // construct full tree of parents
    for (i = 0; i < nNodes; i++) {
        
        parentIndex = findNodeIndexWithChildren(nodes, nNodes, nodes[i].id);
        
        if (parentIndex == NOT_FOUND)
            nodes[i].parentPointer = &root;
        else
            nodes[i].parentPointer = &nodes[parentIndex];
        
    }
    
    for (i = 0; i < nNodes; i++) {
        printf("node %d: ", nodes[i].id);
        
        // parent
        printf("parent = %d, ", nodes[i].parentPointer->id);
        
        // depth
        printf("depth = %d, ", depth(nodes[i]));
        
        // node types
        if (nodes[i].parentPointer->id == -1)
            printf("root, ");
        else if (nodes[i].nChildren > 0)
            printf("internal node, ");
        else 
            printf("leaf, ");
        
        // children
        printf("[");printArray(nodes[i].children, nodes[i].nChildren);printf("]\n");
       
    }
    
//    int id7 = findNodeWithId(nodes, nNodes, 7);
//    printf("findNodeWithId(nodes, nNodes, 7); printchildnum: %d, nid: %d\n", nodes[id7].nChildren, nodes[id7].id);

    return (EXIT_SUCCESS);
}