D. Roads not only in Berland
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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
input
Copy
2 1 2
output
Copy
0
input
Copy
7 1 2 2 3 3 1 4 5 5 6 6 7
output
Copy
1 3 1 3 7
在进行输入边的时候,判断两者 根 是否相同,如果相同,则肯定要删除的,把它加到答案里。
然后再次枚举两个点,如果他们的根不同,说明要加入答案中。
开一个结构体,存储答案。
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1000+66;
const ll mod=1e9+7;
int n;
struct node
{
int i;
int j;
int u;
int v;
} a[maxn];
int f[maxn];
int finds(int x)
{
return f[x]==x?x:f[x]=finds(f[x]);
}
int main()
{
scanf("%d",&n);
int len=0;
for(int i=1; i<=n; i++)
f[i]=i;
for(int i=1; i<=n-1; i++)
{
int u,v;
scanf("%d %d",&u,&v);
int fx=finds(u);
int fy=finds(v);
if(fx==fy&&!vis[fx])
{
a[++len].i=u;
a[len].j=v;
}
else
{
f[fx]=fy;
}
}
int num=len;
for(int i=1; i<=n; i++)finds(i);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
int fx=finds(i);
int fy=finds(j);
if(fx!=fy)
{
a[len].u=i;
a[len].v=j;//新边
len--;
f[fx]=fy;//---
}
}
}
printf("%d\n",num);
for(int i=1;i<=num;i++)
{
printf("%d %d %d %d\n",a[i].i,a[i].j,a[i].u,a[i].v);
}
}