Codeforces Round #260 (Div. 1)C题（并查集+树的直径）

C. Civilization

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Andrew plays a game called "Civilization". Dima helps him.

The game has n cities and m bidirectional roads. The cities are numbered from 1 to n. Between any pair of cities there either is a single (unique) path, or there is no path at all. A path is such a sequence of distinct cities v1, v2, ..., vk, that there is a road between any contiguous cities vi and vi + 1 (1 ≤ i < k). The length of the described path equals to (k - 1). We assume that two cities lie in the same region if and only if, there is a path connecting these two cities.

During the game events of two types take place:

1. Andrew asks Dima about the length of the longest path in the region where city x lies.
2. Andrew asks Dima to merge the region where city x lies with the region where city y lies. If the cities lie in the same region, then no merging is needed. Otherwise, you need to merge the regions as follows: choose a city from the first region, a city from the second region and connect them by a road so as to minimize the length of the longest path in the resulting region. If there are multiple ways to do so, you are allowed to choose any of them.

Dima finds it hard to execute Andrew's queries, so he asks you to help him. Help Dima.

Input

The first line contains three integers n, m, q (1 ≤ n ≤ 3·105; 0 ≤ m < n; 1 ≤ q ≤ 3·105) — the number of cities, the number of the roads we already have and the number of queries, correspondingly.

Each of the following m lines contains two integers, ai and bi (ai ≠ bi; 1 ≤ ai, bi ≤ n). These numbers represent the road between citiesai and bi. There can be at most one road between two cities.

Each of the following q lines contains one of the two events in the following format:

• 1 xi. It is the request Andrew gives to Dima to find the length of the maximum path in the region that contains city xi (1 ≤ xi ≤ n).
• 2 xi yi. It is the request Andrew gives to Dima to merge the region that contains city xi and the region that contains city yi (1 ≤ xi, yi ≤ n). Note, that xi can be equal to yi.

Output

For each event of the first type print the answer on a separate line.

Sample test(s)

input

6 0 6
2 1 2
2 3 4
2 5 6
2 3 2
2 5 3
1 1

output

4

题意：初始状态为n个点，m条边（0=<m<n），这意味着可以是很多棵树，然后有两种操作，1 x表示输出x所在树的最长路径 2 x y表示将x和y所在的树合并成一棵新树，并且要

求这棵新树的最长路径尽量小

思路：其实对树的直径概念很熟的话，这题是直接秒杀的，一棵树的最长路径其实就是树的直径，可以用并查集维护每棵树的直径，然后合并两棵树的时候要使新树的最长路径

（直径）最小，只有当在两棵树的直径的中点之间添加一条边才会使得新树的直径最小，然后新树的最长路径取原来两棵树的直径以及新的路径3者的最大值即可

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
using namespace std;
#define maxn 300010

int n,m,Q;
int head[maxn];
int next[maxn<<1];
int edge[maxn<<1];
int d;
int q[maxn];
int vis[maxn];
int flag;
int fa[maxn];
int bin[maxn];

void add(int u,int v)
{
    edge[d]=v;
    next[d]=head[u];
    head[u]=d++;
}

void bfs(int u,int fl)
{
    int i,rear=0,front=0;
    q[rear++]=u;
    vis[u]=1;

    while(front
       
       
         =0;i--)vis[q[i]]=0; flag=q[rear-1]; } int mfind(int x) { if(fa[x]==x)return x; else return fa[x]=mfind(fa[x]); } int maxi(int x,int y) { return x>y?x:y; } int main() { int i,u,v; while(scanf("%d%d%d",&n,&m,&Q)!=EOF) { memset(head,-1,sizeof(head)); memset(vis,0,sizeof(vis)); memset(bin,0,sizeof(bin)); d=0; for(i=1;i<=n;i++)fa[i]=i; for(i=0;i