-----找规律 hdu 6090-Rikka with Graph
来源:互联网 发布:matlab画图编程例题 编辑:程序博客网 时间:2024/05/20 19:32
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 graph G 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 between i and j, we make dist(i,j) equal to n.
Then, we can define the weight of the graph G (wG) as ∑ni=1∑nj=1dist(i,j).
Now, Yuta has n 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 graph G with n nodes and no more than m edges.
Yuta wants to know the minimal value of wG.
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).
Input
The first line contains a number t(1≤t≤10), the number of the testcases.
For each testcase, the first line contains two numbers n,m(1≤n≤106,1≤m≤1012).
Output
For each testcase, print a single line with a single number – the answer.
Sample Input
1
4 5
Sample Output
14
题目大意:
给你n个节点,让你选择m条边相连,dis[i][j]定义为i点和j点之间的最短路径,求图的最小权重,权重定义为:
(2)图:
(3)图:
解题思路:(1).n个节点最多可以构成n*(n-1)条边,里面的每一条边都是双向的,所以当m>=n*(n-1)/2,w=n*(n-1);(2).当m>=(n-1),正好让n个节点构成一个连通图,此时以某一个点为中心点其他点都与之相连能够使得权重最小,w=2*m+2*(n*(n-1)-2*m);(3).当m<n-1,存在着游离的点,m条边,也就是说有m+1个点是联通的,n-m-1个点是游离的,w=2*m+2*m*(m-1)+n*(n*(n-1)-2*m-m*(m-1)); #include <iostream>#include <stdio.h>#include<algorithm>#include<string.h>using namespace std;typedef long long ll;int main(){ ll n,m; int t; scanf("%d",&t); while(t--) { scanf("%lld%lld",&n,&m); if(n==1) { printf("0\n"); continue; } if(m>=n*(n-1)/2) { printf("%lld\n",n*(n-1)); continue; } if(m>=n-1) printf("%lld\n",2*m+2*(n*(n-1)-2*m)); if(m<n-1) printf("%lld\n",2*m+2*m*(m-1)+n*(n*(n-1)-2*m-m*(m-1))); }}
- -----找规律 hdu 6090-Rikka with Graph
- hdu 6090 Rikka with Graph(找规律)
- HDU 6090 Rikka with Graph(规律)
- HDU 6090 Rikka with Graph【规律】
- HDU6090 Rikka with Graph 找规律签到
- hdu6090 Rikka with Graph (找规律)
- HDU 6090 Rikka with Graph (图论规律题)
- HDU 5422-Rikka with Graph(规律题)
- HDU 5422 Rikka with Graph(规律)
- HDU 6090 Rikka with Graph
- HDU 6090 Rikka with Graph
- [HDU 6090]Rikka with Graph
- hdu 6090 Rikka with Graph
- HDU 6090 Rikka with Graph
- HDU 6090 Rikka with Graph
- hdu 6090-Rikka with Graph
- hdu--6090--Rikka with Graph
- [HDU 6090]Rikka with Graph
- MP4文件格式的解析,以及MP4文件的分割算法
- 程序员职业生涯全攻略
- HDU 5692 Snacks 【DFS序+线段树】
- 一波文学手机电子书
- hadoop集群搭建
- -----找规律 hdu 6090-Rikka with Graph
- 使用java实现windows与linux文件互相传递
- 最少转机-图的广度优先遍历
- 自定义微信登录扫码样式解决办法
- 刷题——Layout POJ
- 搞学术离不开的那些数学—概率论与数理统计
- 数据库相关知识点总结
- 微信小程序实战(二)---实现搜索页面
- Codeforces Round #411 A.Fake NP【数论有关因数结论+经验】