codeforces 120F Spiders

题目链接：传送门。

One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjured a cunning plan: he will glue all the spiders together and attach them to the ceiling. Besides, Petya knows that the lower the spiders will hang, the more mum is going to like it and then she won't throw his favourite toys away. Help Petya carry out the plan.

A spider consists of k beads tied together by k - 1 threads. Each thread connects two different beads, at that any pair of beads that make up a spider is either directly connected by a thread, or is connected via some chain of threads and beads.

Petya may glue spiders together directly gluing their beads. The length of each thread equals 1. The sizes of the beads can be neglected. That's why we can consider that gluing spiders happens by identifying some of the beads (see the picture). Besides, the construction resulting from the gluing process should also represent a spider, that is, it should have the given features.

After Petya glues all spiders together, he measures the length of the resulting toy. The distance between a pair of beads is identified as the total length of the threads that connect these two beads. The length of the resulting construction is the largest distance between all pairs of beads. Petya wants to make the spider whose length is as much as possible.

The picture two shows two spiders from the second sample. We can glue to the bead number 2 of the first spider the bead number 1 of the second spider. The threads in the spiders that form the sequence of threads of maximum lengths are highlighted on the picture.

Input

The first input file line contains one integer n (1 ≤ n ≤ 100) — the number of spiders. Next n lines contain the descriptions of each spider: integer ni (2 ≤ ni ≤ 100) — the number of beads, then ni - 1 pairs of numbers denoting the numbers of the beads connected by threads. The beads that make up each spider are numbered from 1 to ni.

Output

Print a single number — the length of the required construction.

Examples
Input

1
3 1 2 2 3

Output

2

Input

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

Output

4

Input

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

Output

7

【题意】

给你多颗无根树，让你将这多棵树的某些节点链接起来，得到一颗树，问你得到的树的最大直径是多少。

【分析】

显然对于多颗树来说，链接起来后得到的直径显然是小于或等于所有树的直径的和。但是显然也有，如果每棵树我们都选择直径的那一条边，然后链接起来，得到的树显然有：这颗树的直径等于所有树的直径之和，所以显然这样就是最优解。

【代码】

#include<bits/stdc++.h>
using namespace std;
vector<int> poi[105];
int depth[105];
void dfs1(int now,int fa,int dep)
{
    depth[now] = dep;
    int si = poi[now].size();
    if(si==0) return ;
    for(int i = 0;i<si;i++)
    {
        int son = poi[now][i];
        if(son==fa) continue;
        dfs1(son,now,dep+1);
    }
}
int cal(void)
{
    int p,a,b;
    scanf("%d",&p);
    for(int i = 0;i<=p;i++) 
    {
        poi[i].clear();
    }
    for(int i = 1;i<p;i++)
    {
        scanf("%d%d",&a,&b);
        poi[a].push_back(b);
        poi[b].push_back(a);
    }
    dfs1(1,0,0);
    int ind = -1;
    int maxm = 0;
    for(int i = 1;i<=p;i++)
    {
        if(depth[i]>maxm)
        {
            maxm = depth[i];
            ind = i;
        }
    }
    dfs1(ind,0,0);
    maxm = 0;
    for(int i = 1;i<=p;i++)
        maxm = max(maxm,depth[i]);
    return maxm;
}
int main() {
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int ans = 0;
    int len;
    scanf("%d",&len);
    while(len--)
    {
        ans+=cal();
    }
    printf("%d\n",ans);
    return 0;
}