zoukankan      html  css  js  c++  java
  • 1272. Non-Yekaterinburg Subway

    A little town started to construct a subway. The peculiarity of the town is that it is located on small islands, some of them are connected with tunnels or bridges. The mayor is sure that the subway is to be under the ground, that’s why the project must use the less bridges the better. The only request for the subway is that the townsmen could get by metro (may be with changes) from every island to every island. Fortunately, we know that there is enough tunnels and bridges for it. It was decided to construct as less passages from island to island as possible to save money.
    Your task given a town plan to determine the minimal possible number of bridges that is necessary to use in the subway construction.

    Input

    The first line contains three integers separated with a space: N (the number of islands,1 ≤ N ≤ 10000), K (the number of tunnels, 0 ≤ K ≤ 12000) and M (the number of bridges,0 ≤ M ≤ 12000). Then there are K lines; each line consists of two integers — the numbers of islands, connected with the corresponding tunnel. The last M lines define bridges in the same format.

    Output

    the minimal number of bridges necessary for the subway construction.

    Sample

    inputoutput
    6 3 4
    1 2
    2 3
    4 5
    1 3
    3 4
    4 6
    5 6
    2
    Problem Author: Magaz Asanov (prepared Igor Goldberg) Problem Source: Ural State University championship, October 25, 2003
  • 相关阅读:
    保存会话数据——cookie学习
    HttpServletRequest学习
    HttpServletResponse 学习
    Servlet学习
    Http协议简单学习笔记
    利用tomcat配置网站
    PHPCMS-V9 获取一级栏目、二级栏目、三级栏目
    PHP判断当前访问的是 微信、iphone、android 浏览器
    二维数组根据某个字段排序
    动物界的再生一个故事
  • 原文地址:https://www.cnblogs.com/sdau--codeants/p/3242079.html
Copyright © 2011-2022 走看看