Vertical Paths solution codeforces

Vertical Paths solution codeforces

 

You are given a rooted tree consisting of nn vertices. Vertices are numbered from 11 to nn. Any vertex can be the root of a tree.

tree is a connected undirected graph without cycles. A rooted tree is a tree with a selected vertex, which is called the root.

The tree is specified by an array of parents pp containing nn numbers: pipi is a parent of the vertex with the index ii. The parent of a vertex uu is a vertex that is the next vertex on the shortest path from uu to the root. For example, on the simple path from 55 to 33 (the root), the next vertex would be 11, so the parent of 55 is 11.

Vertical Paths solution codeforces

The root has no parent, so for it, the value of pipi is ii (the root is the only vertex for which pi=ipi=i).

Find such a set of paths that:

  • each vertex belongs to exactly one path, each path can contain one or more vertices;
  • in each path each next vertex — is a son of the current vertex (that is, paths always lead down — from parent to son);
  • amount of paths is minimal.

For example, if n=5n=5 and p=[3,1,3,3,1]p=[3,1,3,3,1], then the tree can be divided into three paths:

  1. 3153→1→5 (path of 33 vertices),
  2. 44 (path of 11 vertices).
  3. 22 (path of 11 vertices).

Example of splitting a root tree into three paths for n=5n=5, the root of the tree — node 33.
Input

The first line of input data contains an integer tt (1t1041≤t≤104) — the number of test cases in the test.

Each test case consists of two lines.

The first of them contains an integer nn (1n21051≤n≤2⋅105). It is the number of vertices in the tree.

The second line contains nn integers p1,p2,,pnp1,p2,…,pn (1pin1≤pi≤n). It is guaranteed that the pp array encodes some rooted tree.

It is guaranteed that the sum of the values nn over all test cases in the test does not exceed 21052⋅105.

Vertical Paths solution codeforces

For each test case on the first line, output an integer mm — the minimum amount of non-intersecting leading down paths that can cover all vertices of the tree.

Then print mm pairs of lines containing path descriptions. In the first of them print the length of the path, in the second — the sequence of vertices specifying that path in the order from top to bottom. You can output the paths in any order.

If there are several answers, output any of them.

Example

input

Vertical Paths solution codeforces

6
5
3 1 3 3 1
4
1 1 4 1
7
1 1 2 3 4 5 6
1
1
6
4 4 4 4 1 2
4
2 2 2 2

output

Copy
3
3
3 1 5
1
2
1
4

2
2
1 2
2
4 3

1
7
1 2 3 4 5 6 7

1
1
1

3
3
4 1 5
2
2 6
1
3

3
2
2 1
1
3
1
4

Leave a Comment