D. Roads not only in Berland

D. Roads not only in Berland

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Berland Government decided to improve relations with neighboring countries. First of all, it was decided to build new roads so that from each city of Berland and neighboring countries it became possible to reach all the others. There are n cities in Berland and neighboring countries in total and exactly n - 1 two-way roads. Because of the recent financial crisis, the Berland Government is strongly pressed for money, so to build a new road it has to close some of the existing ones. Every day it is possible to close one existing road and immediately build a new one. Your task is to determine how many days would be needed to rebuild roads so that from each city it became possible to reach all the others, and to draw a plan of closure of old roads and building of new ones.

Input
The first line contains integer n (2 ≤ n ≤ 1000) — amount of cities in Berland and neighboring countries. Next n - 1 lines contain the description of roads. Each road is described by two space-separated integers ai, bi (1 ≤ ai, bi ≤ n, ai ≠ bi) — pair of cities, which the road connects. It can’t be more than one road between a pair of cities. No road connects the city with itself.

Output
Output the answer, number t — what is the least amount of days needed to rebuild roads so that from each city it became possible to reach all the others. Then output t lines — the plan of closure of old roads and building of new ones. Each line should describe one day in the format i j u v — it means that road between cities i and j became closed and a new road between cities u and v is built. Cities are numbered from 1. If the answer is not unique, output any.

Examples
inputCopy
2
1 2
outputCopy
0
inputCopy
7
1 2
2 3
3 1
4 5
5 6
6 7
outputCopy
1
3 1 3 7

大题思路解析

目的就是将所有 点连起来
题目状态是一个有一个 合集
可以使用并查集 将他们 分组
然后 压缩路径 使得每组根唯一

最后状态 是 都联通
一定题目 给链路中有 重复的

判断重复的 存储链路 这些就是最后需要转换的

最后状态都连通 从1扫到n 就是判断分组
每组取出一个 点 然后不同组之间连接 最终。。。连通

AC代码

#include<iostream>
#include<cstdio>

#include<cstring>
#include<sstream>
#include<iomanip>
#include<bitset>

#include<cmath>
#include<algorithm>
#include<cstdlib>

#include<set>
#include<queue>
#include<map>
#include<vector>

#define ll long long 
#define lowbit(x)  x&-x
using namespace std;
const ll inf = 0x3f3f3f3f;
typedef pair<int,int> PII;
vector< PII >s;
const int nn =1010;
int f[nn],pre[nn];
int n;
vector<int> v;
int find( int x){
	if(x!=pre[x]) pre[x]=find(pre[x]);
	return pre[x];
}
int main()
{
	//#define io
    #ifdef io
        freopen("in.txt","r",stdin);
    #endif
    cin>>n;
    for(int i=1;i<=n;i++)
    pre[i]=i;
    for(int i=0;i<n-1;i++){
        int x,y;
        cin>>x>>y;
        int xx=find(x);
        int yy=find(y);
        if(xx==yy){
            s.push_back({x,y});
		}else pre[yy]=xx;
	}
	for(int i=1;i<=n;i++){
		if(f[find(i)]==0){
			f[find(i)]=1;
			v.push_back(i);
		}
	}
	cout<<s.size()<<endl;
	for(int i=0;i<s.size();i++){
		cout<<s[i].first<<" "
		<<s[i].second<<" "
		<<v[i]<<" "<<v[i+1]<<endl;
	}
	return 0 ;
}