CF--T-decomposition--模拟

D. T-decomposition

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You've got a undirected tree s, consisting of n nodes. Your task is to build an optimal T-decomposition for it. Let's define a T-decomposition as follows.

Let's denote the set of all nodes s as v. Let's consider an undirected tree t, whose nodes are some non-empty subsets of v, we'll call them xi . The tree t is a T-decomposition of s, if the following conditions holds:

1. the union of all xi equals v;
2. for any edge (a, b) of tree s exists the tree node t, containing both a and b;
3. if the nodes of the tree t xi and xj contain the node a of the tree s, then all nodes of the tree t, lying on the path from xi to xj also contain node a. So this condition is equivalent to the following: all nodes of the tree t, that contain node a of the tree s, form a connected subtree of tree t.

There are obviously many distinct trees t, that are T-decompositions of the tree s. For example, a T-decomposition is a tree that consists of a single node, equal to set v.

Let's define the cardinality of node xi as the number of nodes in tree s, containing in the node. Let's choose the node with the maximum cardinality in t. Let's assume that its cardinality equals w. Then the weight of T-decomposition t is value w. The optimal T-decomposition is the one with the minimum weight.

Your task is to find the optimal T-decomposition of the given tree s that has the minimum number of nodes.

Input

The first line contains a single integer n (2 ≤ n ≤ 105), that denotes the number of nodes in tree s.

Each of the following n - 1 lines contains two space-separated integers ai, bi (1 ≤ ai, bi ≤ n; ai ≠ bi), denoting that the nodes of tree s with indices ai and bi are connected by an edge.

Consider the nodes of tree s indexed from 1 to n. It is guaranteed that s is a tree.

Output

In the first line print a single integer m that denotes the number of nodes in the required T-decomposition.

Then print m lines, containing descriptions of the T-decomposition nodes. In the i-th (1 ≤ i ≤ m) of them print the description of node xi of the T-decomposition. The description of each node xi should start from an integer ki, that represents the number of nodes of the initial tree s, that are contained in the node xi. Then you should print ki distinct space-separated integers — the numbers of nodes from s, contained in xi, in arbitrary order.

Then print m - 1 lines, each consisting two integers pi, qi (1 ≤ pi, qi ≤ m; pi ≠ qi). The pair of integers pi, qi means there is an edge between nodes xpi and xqi of T-decomposition.

The printed T-decomposition should be the optimal T-decomposition for the given tree s and have the minimum possible number of nodes among all optimal T-decompositions. If there are multiple optimal T-decompositions with the minimum number of nodes, print any of them.

Examples

input

Copy

2
1 2

output

Copy

1
2 1 2

input

Copy

3
1 2
2 3

output

Copy

2
2 1 2
2 2 3
1 2

input

Copy

4
2 1
3 1
4 1

output

Copy

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

题意：

一颗树s，需要根据三个规则构成一个新的树t。

1、s中的一些点可以缩成一个点，从而新成很多缩点构成树t。t中要用到所有的s中点

2、若s中有a-b边，那么t中要有点要包含ab两个点

3、t中的新点若x,y之间有边（x y都包含s中的a点），那么x-y之间的路径上的点都要包含a点。

第一行输出t树中点的个数

接着输出t中点包含点的个数、点的标号

接着输出t中的点和点之间的连接

思路：

相邻的两点形成一个缩点即可。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=100000+66;
const ll mod=1e9+7;
int n;
int a[maxn];
int b[maxn];
vector<int>v[maxn];
int main()
{
    scanf("%d",&n);
    for(int i=1; i<n; i++)
    {
        scanf("%d %d",&a[i],&b[i]);
        v[a[i]].push_back(i);
        v[b[i]].push_back(i);
    }
    printf("%d\n",n-1);
    for(int i=1;i<n;i++)
    {
        printf("2 %d %d\n",a[i],b[i]);
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<v[i].size()-1;j++)
        {
            printf("%d %d\n",v[i][j],v[i][j+1]);
        }
    }

}