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的更多相关文章

  1. Codeforces Gym 100286J Javanese Cryptoanalysis 傻逼暴力

    原题地址:http://codeforces.com/gym/100286/attachments/download/2013/20082009-acmicpc-northeastern-europe ...

  2. Codeforces Gym 100342C Problem C. Painting Cottages 暴力

    Problem C. Painting CottagesTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/1 ...

  3. 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 ...

  4. Codeforces Gym 100203G G - Good elements 标记暴力

    G - Good elementsTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hust.edu.cn/vjudge/contest/ ...

  5. Codeforces Gym 100650D Queens, Knights and Pawns 暴力

    Problem D: Queens, Knights and PawnsTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hust.edu ...

  6. Codeforces Gym 101190M Mole Tunnels - 费用流

    题目传送门 传送门 题目大意 $m$只鼹鼠有$n$个巢穴,$n - 1$条长度为$1$的通道将它们连通且第$i(i > 1)$个巢穴与第$\left\lfloor \frac{i}{2}\rig ...

  7. Codeforces Gym 101252D&&floyd判圈算法学习笔记

    一句话题意:x0=1,xi+1=(Axi+xi%B)%C,如果x序列中存在最早的两个相同的元素,输出第二次出现的位置,若在2e7内无解则输出-1. 题解:都不到100天就AFO了才来学这floyd判圈 ...

  8. Codeforces Gym 101623A - 动态规划

    题目传送门 传送门 题目大意 给定一个长度为$n$的序列,要求划分成最少的段数,然后将这些段排序使得新序列单调不减. 考虑将相邻的相等的数缩成一个数. 假设没有分成了$n$段,考虑最少能够减少多少划分 ...

  9. 【Codeforces Gym 100725K】Key Insertion

    Codeforces Gym 100725K 题意:给定一个初始全0的序列,然后给\(n\)个查询,每一次调用\(Insert(L_i,i)\),其中\(Insert(L,K)\)表示在第L位插入K, ...

随机推荐

  1. js中document.all 的用法

    1. document.all是什么? document.all 实质就是文档中所有元素的集合.可以看做一个数组.   2.document.all怎么用? 2.1 根据下标取元素. 语法: docu ...

  2. TortoiseSVN 插件配置及使用方法

    一.安装和配置 TortoiseSVN的下载地址 32bit:TortoiseSVN-1.8.2.24708-win32-svn-1.8.3.msi 64bit:TortoiseSVN-1.8.2.2 ...

  3. bzoj1013

    这道题题解太多,只贴代码. #include<cstdio> #include<cmath> #include<algorithm> using namespace ...

  4. php时间函数

    PHP中的时间函数有这么些:(1)date用法: date(格式,[时间]);如果没有时间参数,则使用当前时间. 格式是一个字符串,其中以下字符有特殊意义:U 替换成从一个起始时间(好象是1970年1 ...

  5. vmware设置centos虚拟机nat联网(转载)

    今天在vmware虚拟主机中安装hearbeat,为了使用最新的版本,选用编译安装了.在编译过程中,需要连接被墙的网站下载文件,那只能用vpn,但我使用的是桥接方式联网,使用不了真实主机的vpn,于是 ...

  6. linux命令 screen的简单使用

    在远程命令行下某些长时间的操作,一旦网络出现故障,后果可能会很严重,在这种情况下可以使用screen命令来解决.screen可以创建一个session,在不小心断开以后还可以继续恢复session保存 ...

  7. cocos2d-js取不到cocostudio里面控件问题

    var winSize = cc.director.getWinSize(); //add main node var mainNode = cc.Node.create(); ; mainNode. ...

  8. dom 表格操作

    <!doctype html> <html> <head> <meta charset="utf-8"> <title> ...

  9. canvas脏域问题纪录

    canvas 脏域问题 今天无意之中碰见了一.问题描述: 在支持html5的浏览器中运行javascript脚本,脚本主要是操作网页上的标签canvas,出错的操作为, getImageData(im ...

  10. 给Asp.net MVC Forms 验证设置角色访问控制

    当我们使用Asp.net MVC Forms方式验证用户, 然后设置Controller 或 Action 的 Authorize属性时, 默认情况下只有Users属性可以设置(这里的Users通常是 ...