Codeforces Gym 100803F There is No Alternative 暴力Kruskal
There is No Alternative
题目连接:
http://codeforces.com/gym/100803/attachments
Description
ICPC (Isles of Coral Park City) consist of several beautiful islands.
The citizens requested construction of bridges between islands to resolve inconveniences of using
boats between islands, and they demand that all the islands should be reachable from any other
islands via one or more bridges.
The city mayor selected a number of pairs of islands, and ordered a building company to estimate
the costs to build bridges between the pairs. With this estimate, the mayor has to decide the
set of bridges to build, minimizing the total construction cost.
However, it is difficult for him to select the most cost-efficient set of bridges among those
connecting all the islands. For example, three sets of bridges connect all the islands for the
Sample Input 1. The bridges in each set are expressed by bold edges in Figure F.1.
Figure F.1. Three sets of bridges connecting all the islands for Sample Input 1
As the first step, he decided to build only those bridges which are contained in all the sets
of bridges to connect all the islands and minimize the cost. We refer to such bridges as no
alternative bridges. In Figure F.2, no alternative bridges are drawn as thick edges for the
Sample Input 1, 2 and 3.
Write a program that advises the mayor which bridges are no alternative bridges for the given
input.
Input
The first line contains two positive integers N and M. N represents the number of islands and
each island is identified by an integer 1 through N. M represents the number of the pairs of
islands between which a bridge may be built.
Each line of the next M lines contains three integers Si
, Di and Ci (1 ≤ i ≤ M) which represent
that it will cost Ci to build the bridge between islands Si and Di
. You may assume 3 ≤ N ≤ 500,
N − 1 ≤ M ≤ min(50000, N(N − 1)/2), 1 ≤ Si < Di ≤ N, and 1 ≤ Ci ≤ 10000. No two bridges
connect the same pair of two islands, that is, if i 6= j and Si = Sj , then Di 6= Dj . If all the
candidate bridges are built, all the islands are reachable from any other islands via one or more
bridges.
Output
Output two integers, which mean the number of no alternative bridges and the sum of their
construction cost, separated by a space.
Sample Input
4 4
1 2 3
1 3 3
2 3 3
2 4 3
Sample Output
1 3
Hint
题意
给你一个图,然后问你有哪些边一定在所有的最小生成树上面
题解:
点只有500,所以我们直接O(nm)暴力就好了
我们只用ban掉一开始在最小生成树上的边,然后判断就好了
代码
#include<bits/stdc++.h>
using namespace std;
const int maxn = 100050;
int u[maxn],v[maxn],w[maxn],r[maxn];
int pa[maxn],n,m;
int vis[maxn];
int ans1=0,ans2=0;
bool cmp(int i,int j)
{
return w[i]<w[j];
}
int fi(int x)
{
return pa[x]==x?x:pa[x]=fi(pa[x]);
}
int kruskal(int c)
{
int ans=0;
int num=0;
for(int i=0;i<=n;i++)
pa[i]=i;
for(int i=0;i<m;i++)
{
if(i==c)continue;
int e=r[i];
int x=fi(u[e]);
int y=fi(v[e]);
if(x!=y)
{
num++;
vis[i]=1;
ans+=w[e],pa[x]=y;
}
if(num==n-1)break;
}
if(num!=n-1)return -1;
return ans;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++)
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
u[i]=x,v[i]=y,w[i]=z;
}
for(int i=0;i<m;i++)
r[i]=i;
sort(r,r+m,cmp);
int temp = kruskal(m);
for(int i=0;i<m;i++)
{
if(!vis[i])continue;
if(temp!=kruskal(i))
{
ans1++;
ans2+=w[r[i]];
}
}
cout<<ans1<<" "<<ans2<<endl;
}
Codeforces Gym 100803F There is No Alternative 暴力Kruskal的更多相关文章
- Codeforces Gym 100286J Javanese Cryptoanalysis 傻逼暴力
原题地址:http://codeforces.com/gym/100286/attachments/download/2013/20082009-acmicpc-northeastern-europe ...
- Codeforces Gym 100342C Problem C. Painting Cottages 暴力
Problem C. Painting CottagesTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/1 ...
- Codeforces Gym 100513I I. Sale in GameStore 暴力
I. Sale in GameStore Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100513/p ...
- Codeforces Gym 100203G G - Good elements 标记暴力
G - Good elementsTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hust.edu.cn/vjudge/contest/ ...
- Codeforces Gym 100650D Queens, Knights and Pawns 暴力
Problem D: Queens, Knights and PawnsTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hust.edu ...
- Codeforces Gym 101190M Mole Tunnels - 费用流
题目传送门 传送门 题目大意 $m$只鼹鼠有$n$个巢穴,$n - 1$条长度为$1$的通道将它们连通且第$i(i > 1)$个巢穴与第$\left\lfloor \frac{i}{2}\rig ...
- Codeforces Gym 101252D&&floyd判圈算法学习笔记
一句话题意:x0=1,xi+1=(Axi+xi%B)%C,如果x序列中存在最早的两个相同的元素,输出第二次出现的位置,若在2e7内无解则输出-1. 题解:都不到100天就AFO了才来学这floyd判圈 ...
- Codeforces Gym 101623A - 动态规划
题目传送门 传送门 题目大意 给定一个长度为$n$的序列,要求划分成最少的段数,然后将这些段排序使得新序列单调不减. 考虑将相邻的相等的数缩成一个数. 假设没有分成了$n$段,考虑最少能够减少多少划分 ...
- 【Codeforces Gym 100725K】Key Insertion
Codeforces Gym 100725K 题意:给定一个初始全0的序列,然后给\(n\)个查询,每一次调用\(Insert(L_i,i)\),其中\(Insert(L,K)\)表示在第L位插入K, ...
随机推荐
- npoi z
http://blog.csdn.net/fireghost57/article/details/25623143 http://www.cnblogs.com/jiagoushi/archive/2 ...
- GIT 命令 操作 记录
1.git pull时冲突的解决 1.git stash 2.git pull 3.git stash pop stash@{0} 4.修改冲突 5.git add . 6.git commit 7. ...
- Android的主要组件
(一)Activity(活动) 作用:提供可视化用户界面 只能通过setContentView(View)来显示指定组件 View组件是所有UI控件.容器控件的基类,View组件就是android应用 ...
- 基本的SQL Server 语句,包含 增、删、改、查 程序员必会
这是我以前学习时, 整理的一套基础SQL Server增.删.改.查 等语句 ,初学者可以从上往下学完. 也方便自己忘记时翻看! create database SQLschool go --批 go ...
- hadoop是什么?
在如今这个信息高速发展的今天,hadoop也越来越火了,那么到底是什么原因让hadoop如此的火,接下来新霸哥将详细的为了介绍,并让你快速的任何hadoop是什么? hadoop思想起源:Google ...
- 配置spring管理的bean的作用域
.singleton 在每一个spring Ioc容器中一个bean定义只有一个对象实例.默认情况下会在容器启动时初始化bean,但我们可以指定bean节点的lazy-init = "tru ...
- WMI使用的WIN32_类库名
WMI使用的WIN32_类库名 包括:硬件类.操作系统类.安装应用程序类.WMI服务管理类.性能计数器类1.硬件类冷却类别Win32_Fan--风扇Win32_HeatPipe--热管Win32_Re ...
- Maven依赖
可传递的依赖: 1.具体调用哪个版本?最短依赖长度的那个 如:A -> B -> C -> D 2.0 , A -> E -> D 1.0,那么调用D 1.0 为了避免这 ...
- HP ILO2 使用详细教程
iLO是Intergrated Light-Out的缩写,是惠普特有的远程管理功能,目前最新的版本是iLO2.通过iLO2可以实现硬件级别的服务器远程管理,包括开关机.重启.服务器状态的监控.虚拟KV ...
- 【原】创建Hive表,分号分隔符“;”引起的异常
[障碍再现] 在创建支持Map数据结构的Hive表时,抛出如下异常 hive> create table tab_map(name string,info map<string,strin ...