zoukankan      html  css  js  c++  java
  • CodeForces 25D Roads not only in Berland

    Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    Description

    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.

    Sample Input

    Input
    2
    1 2
    Output
    0
    Input
    7
    1 2
    2 3
    3 1
    4 5
    5 6
    6 7
    Output
    1
    3 1 3 7

    题意:给出n座城镇,这n座城镇有n-1条路相连,要你拆掉一些路,建立一些路,使城镇之间n-1条路不成环。

     1 #include<cstring>
     2 #include<iostream>
     3 #include<algorithm>
     4 #include<cstdio>
     5 
     6 using namespace std;
     7 
     8 
     9 int s[1006];
    10 int a[1005];
    11 int b[1006];
    12 int c[1005];
    13 int d[1006];
    14 
    15 int Find(int x)
    16 {
    17     return x==s[x]?x:s[x]=Find(s[x]);
    18 }
    19 
    20 int main()
    21 {
    22     int n;
    23     while(scanf("%d",&n)!=EOF)
    24     {
    25         for(int i=0;i<=n;i++) s[i]=i;
    26         int num=0;
    27         for(int i=0;i<n-1;i++)
    28         {
    29             int x,y;
    30             scanf("%d%d",&x,&y);
    31             int x1=Find(x);
    32             int y1=Find(y);
    33             if(x1==y1)
    34             {
    35                 a[num]=x;
    36                 b[num]=y;
    37                 num++;
    38             }
    39             else s[x1]=y1;
    40         }
    41 
    42         if(num==0) printf("0
    ");
    43         else
    44         {
    45             num=0;
    46             for(int i=1;i<=n;i++)
    47             {
    48                 int x=Find(1);
    49                 int y=Find(i);
    50                 if(x!=y)
    51                 {
    52                     s[x]=y;
    53                     c[num]=1;
    54                     d[num++]=i;
    55                 }
    56             }
    57 
    58             printf("%d
    ",num);
    59             for(int i=0;i<num;i++)
    60             {
    61                 printf("%d %d %d %d
    ",a[i],b[i],c[i],d[i]);
    62             }
    63         }
    64     }
    65 }
  • 相关阅读:
    EF之Model First
    easyui报错 Cannot read property 'length' of null
    EF迁移报错An operation was scaffolded that may result in the loss of data. Please review the migration for accuracy.
    Vue脚手架搭建
    [LeetCode No.20] 有效的括号
    爬虫-给女朋友的每日天气预报
    [LeetCode No.316] 去除重复字母
    [LeetCode No.738] 单调递增的数字
    [LeetCode No.49] 字母异味词分组
    [LeetCode No.34] 在排序数组中查找元素的第一个和最后一个位置
  • 原文地址:https://www.cnblogs.com/wsaaaaa/p/4517554.html
Copyright © 2011-2022 走看看