hdu 6090(二)
来源:互联网 发布:卡盟下单源码 编辑:程序博客网 时间:2024/05/22 17:32
Rikka with Graph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 72 Accepted Submission(s): 51
Total Submission(s): 72 Accepted Submission(s): 51
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:
For an undirected graphG with n nodes and m edges, we can define the distance between (i,j) (dist(i,j) ) as the length of the shortest path between i and j . The length of a path is equal to the number of the edges on it. Specially, if there are no path betweeni and j , we make dist(i,j) equal to n .
Then, we can define the weight of the graphG (wG ) as ∑ni=1∑nj=1dist(i,j) .
Now, Yuta hasn nodes, and he wants to choose no more than m pairs of nodes (i,j)(i≠j) and then link edges between each pair. In this way, he can get an undirected graphG with n nodes and no more than m edges.
Yuta wants to know the minimal value ofwG .
It is too difficult for Rikka. Can you help her?
In the sample, Yuta can choose(1,2),(1,4),(2,4),(2,3),(3,4) .
For an undirected graph
Then, we can define the weight of the graph
Now, Yuta has
Yuta wants to know the minimal value of
It is too difficult for Rikka. Can you help her?
In the sample, Yuta can choose
Input
The first line contains a number t(1≤t≤10) , the number of the testcases.
For each testcase, the first line contains two numbersn,m(1≤n≤106,1≤m≤1012) .
For each testcase, the first line contains two numbers
Output
For each testcase, print a single line with a single number -- the answer.
Sample Input
14 5
Sample Output
14
题目大意:给你两个数字n,m分别代表的是有多少点多少边,每个边的长度为1,现在让你求m条边构成的图中,所有的点相连所需要的长度和最小。
解题思路:找规律,发现m在不同的范围内,所求的答案有不同的公式表示,每两个点之间共有n*(n-1)/2种可能如果m大于等于这个数就直接为n*(n-1)如果少于它则一个边一个边的进行拆除没拆一个边就增加2然后到一个临界点为m=n-1一个点分别连其他的点可以根据上一个算出,当m小于这个数的时候就分为孤立的点了,有一部分相连,就和上一种情况一样然后分联通的,孤立的,联通的与孤立的分别计算。
- #include<cstdio>
- using namespace std;
- int main()
- {
- int t;
- scanf("%d",&t);
- while(t--)
- {
- long long n,m,p,q;
- scanf("%lld%lld",&n,&m);
- long long ans=0;
- int flag=0;
- if(m>n*(n-1)/2)///在这个范围内代表每两个点之间都可以一步连到所以为n*(n-1)
- {
- printf("%lld\n",n*(n-1));
- flag=1;
- }
- else if(m>=n-1&&m<=n*(n-1)/2)///在这个范围内与m为n*(n-1)/2相比每少一条边就减少2
- {
- ans+=((n*(n-1)/2)-m)*2+n*(n-1);
- }
- else///这个范围内分为孤立的点与连在一起的点,分三块计算
- {
- p=m+1;
- q=n-m-1;
- ans+=q*p*n*2+q*(q-1)*n+(p-1)*(p-1)*2;
- }
- if(flag==0)
- printf("%lld\n",ans);
- }
- }
阅读全文
0 0
- hdu 6090(二)
- hdu 6092(二)
- HDU-#2021-2050 HDU水题系列(二)
- hdu 1085 母函数(二)
- HDU 1754 线段树应用(二)
- 排列组合(二) - HDU 1436 dp
- HDU-1505 最大矩形问题(二)
- hdu 1043带来的启示(二)
- HDU 4553(二棵线段树)
- hdu 1372 解法二
- hdu 1856 More is better 并查集(二)
- Hdu 1398 Square Coins//整数划分(二)
- hdu 1505 City Game 矩阵系列(二)
- hdu 2042 不容易系列之二 (水题)
- HDU ACM 2207 IP的计算(二)
- hdu 2042 不容易系列之二 (java)
- hdu 5285 wyh2000 and pupil(二染色)
- HDU 2042 不容易系列之二(水~)
- java正则表达
- python 抓取音乐
- 在Ubuntu上配置ftp服务
- 关于Android 应用新手引导页面的小例子
- POJ2406——Power Strings(后缀数组)
- hdu 6090(二)
- 前言的闲话以及第一章的入门(三)
- 20、密码验证合格程序
- hdu 6090(三)
- java编程加载窗口,插入图片
- 手机浏览pc网页,字体显示比样式中设置的字体更大
- python3 利用suds-jurko测试webservice接口
- shell脚本里括号用法总结
- Dao 接口的基本操作