HDU 6090 Rikka with Graph(规律)
来源:互联网 发布:苏州网络招募中心 编辑:程序博客网 时间:2024/06/01 10:29
Rikka with Graph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 446 Accepted Submission(s): 280
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 between i 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 graph G 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
Source
2017 Multi-University Training Contest - Team 5
考虑贪心地一条一条边添加进去。
当 m≤n−1 时,我们需要最小化距离为 n 的点对数,所以肯定是连出一个大小为 m+1 的联通块,剩下的点都是孤立点。在这个联通块中,为了最小化内部的距离和,肯定是连成一个菊花的形状,即一个点和剩下所有点直接相邻。
当 m>n−1 时,肯定先用最开始 n−1 条边连成一个菊花,这时任意两点之间距离的最大值是 2。因此剩下的每一条边唯一的作用就是将一对点的距离缩减为 1。
这样我们就能知道了最终图的形状了,稍加计算就能得到答案。要注意 m 有可能大于 2n(n−1)。
当时算算错。#include <iostream>#include <stdio.h>#include <string.h>#include <math.h>#include <algorithm>using namespace std;#define LL long longint main(){ int T; scanf("%d",&T); while(T--) { LL n,m; scanf("%lld %lld",&n,&m); LL ans; if(m>=n*(n-1)/2) printf("%lld\n",n*(n-1)); else if(m>n-1) { printf("%lld\n",2*((n-2)*(n-1)+n-1-(m-n+1))); } else { LL x=n-(m+1); ans=2*m+(m)*(m-1)*2+(n-1)*x*n+(m+1)*x*n; printf("%lld\n",ans); } }}
阅读全文
0 0
- 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 5422-Rikka with Graph(规律题)
- HDU 5422 Rikka with Graph(规律)
- HDU 6090 Rikka with Graph(思维)
- Rikka with Graph(HDU 6090)
- 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
- 记录oracle 多行合并成一行(备忘)
- 手机照片和通讯录误删了怎么办?用这个方法能让你迅速找回!
- Echarts集装报表
- android系统目录system/framework下各个jar包的用途
- POJ2337 Catenyms【欧拉回路】
- HDU 6090 Rikka with Graph(规律)
- python 中sorted()函数
- OAuth
- OpenCV学习笔记7-图像算术运算
- Python continue 语句
- 进阶2.JavaScript深入之词法作用域和动态作用域
- POJ
- SecureRandom生成随机数超慢 导致tomcat启动时间过长的解决办法
- 数据结构上机测试2-1:单链表操作A