HDOJ 5631 Rikka with Graph
来源:互联网 发布:电脑编程哪儿工资高 编辑:程序博客网 时间:2024/06/05 07:08
Rikka with Graph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1037 Accepted Submission(s): 497
Problem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:
Yuta has a non-direct graph with n vertices and n+1 edges. Rikka can choose some of the edges (at least one) and delete them from the graph.
Yuta wants to know the number of the ways to choose the edges in order to make the remaining graph connected.
It is too difficult for Rikka. Can you help her?
Yuta has a non-direct graph with n vertices and n+1 edges. Rikka can choose some of the edges (at least one) and delete them from the graph.
Yuta wants to know the number of the ways to choose the edges in order to make the remaining graph connected.
It is too difficult for Rikka. Can you help her?
Input
The first line contains a number T(T≤30) ——The number of the testcases.
For each testcase, the first line contains a numbern(n≤100) .
Then n+1 lines follow. Each line contains two numbersu,v , which means there is an edge between u and v.
For each testcase, the first line contains a number
Then n+1 lines follow. Each line contains two numbers
Output
For each testcase, print a single number.
Sample Input
131 22 33 11 3
Sample Output
9
Source
BestCoder Round #73 (div.2)
这个题要注意一点,n个点要要能连接起来,最少需要n-1条边。所以这题可以暴力。但是时间很大(不过数据好像很弱所以没事)
一共给了n+1条边,我们只能去掉1条边或者2条边。2条以上的被去掉,肯定不能连通。
题意:一个人给了好多条边,问有多少种连法可以让这些点连通?
#include<stdio.h>#include<string.h>int per[111],u[111],v[111],use[111],n;int Find(int x){while(x!=per[x])x=per[x];return x;}void Merge(int x,int y){int fx=Find(x);int fy=Find(y);if(fx!=fy)per[fx]=fy;}int Judge(){int i;for(i=1;i<=n;i++)per[i]=i;for(i=0;i<=n;i++)if(use[i])Merge(u[i],v[i]);int cnt=0;for(i=1;i<=n;i++){if(per[i]==i)cnt++;if(cnt>1)return 0;}return 1;}int main(){int T,i,j;scanf("%d",&T);while(T--){memset(use,0,sizeof(use));scanf("%d",&n);for(i=0;i<=n;i++){scanf("%d%d",&u[i],&v[i]);use[i]=1;}int ans=0;for(i=0;i<=n;i++){use[i]=0;if(Judge())ans++;for(j=i+1;j<=n;j++){use[j]=0;if(Judge())ans++;use[j]=1;}use[i]=1;}printf("%d\n",ans);}return 0;}
0 0
- HDOJ 5631 Rikka with Graph
- HDOJ-5631 Rikka with Graph
- HDOJ 5631 Rikka with Graph
- HDOJ 5631Rikka with Graph(图论)
- HDOJ 5631 Rikka with Graph (删边判断连通性)
- HDOJ 5631 Rikka with Graph(并查集)
- hdoj 5631 Rikka with Graph 【并查集】
- hdoj Rikka with Graph 5631 (并查集)
- hdoj 5631 Rikka with Graph 【并查集】
- HDU 5631 Rikka with Graph
- HDU 5631 Rikka with Graph
- HDU 5631 Rikka with Graph
- HDU 5631 Rikka with Graph
- HDU 5631 Rikka with Graph
- HDOJ 5424 Rikka with Graph II 暴力dfs
- 杭电5631Rikka with Graph
- HDU 5631 Rikka with Graph(BC)
- 【杭电】[5631]Rikka with Graph
- 【NAS】NFS问题clnt_create: RPC: Unknown host的解决方法
- iOS开发-OpenGL ES入门教程1
- cudaDeviceReset
- Android高级控件——GridView ScrollView ViewPager (上)
- Keras安装与简介
- HDOJ 5631 Rikka with Graph
- 数据结构实验之排序七:选课名单 (sdut oj3404)
- 关于DataTable中参照实例的注意事项
- iOS上用GPUImage给视频加滤镜
- POJ 1905 Expanding Rods(二分)
- 【opencv练习01-打开显示图片】
- Java---->String的基本操作
- mysql-5.7.13 解压版安装教程
- ssss