HDU6090-Rikka with Graph
来源:互联网 发布:进销存软件源码下载 编辑:程序博客网 时间:2024/06/08 09:22
Rikka with Graph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 794 Accepted Submission(s): 452
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
题意:给出n个点,在它们之间加入m条边,使得任意两点的距离和最小(两点距离为两点之间的最短路,一条边的距离为1,两点之间不能达到则距离为n)
解题思路:先随意找一个根节点,在m足够大的条件下,将它和其他所有点相连,则此时答案为2*(n-1)*(n-1),若边有多余,则在除根节点的任意两点之间加边,每加一条边答案减2
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <unordered_map>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;LL n,m;int main(){ int t; scanf("%d", &t); while(t--) { scanf("%lld %lld", &n, &m); LL sum = 0; if(m >= n - 1) { m = min(m, n * (n - 1) / 2); sum += 2 * (n - 1) * (n - 1); m -= n - 1; sum -= m * 2; } else { sum += 2 * m * m; sum += (m + 1) * (n - m -1) * n; sum += (n - m -1) * n * (n - 1); } printf("%lld\n", sum); } return 0;}
阅读全文
0 0
- HDU6090 Rikka with Graph
- HDU6090 Rikka with Graph
- HDU6090 Rikka with Graph
- hdu6090 Rikka with Graph
- hdu6090 Rikka with Graph
- HDU6090-Rikka with Graph
- HDU6090 Rikka with Graph 找规律签到
- hdu6090 Rikka with Graph (找规律)
- HDU6090-思维&构造&贪心&&2017多校5-Rikka with Graph
- Hdu6090 Rikka with Graph(2017多校第5场)
- 2017多校训练Contest5: 1006 Rikka with Graph hdu6090
- hdu6090 Rikka with Graph 2017多校第五场1006 找规律
- HDU6090 Rikka with Graph(贪心,思路,2017 HDU多校联赛 第5场)
- HDU6090---Rikka with Graph(2017多校联赛:思路题)
- Rikka with Graph
- Bc Rikka with Graph
- Rikka with Graph<hdoj5631>
- Rikka with Graph HDU
- linux下安装usb转pl2303串口驱动
- 不需要预训练模型的检测算法—DSOD
- 算法排序之插入排序
- Spring自定义tag标签及使用
- 线程干扰错误
- HDU6090-Rikka with Graph
- 求解一元二次方程的解
- -----尺取法 hdu 6103-Kirinriki
- 自已动手编译Linux系统-基于ALFS的LFS8.0实践(六)
- 学习笔记TF037:实现强化学习策略网络
- [linux] cp指令
- 浮点数的表示和精度(转)
- Stream Java8的集合类利器——走进Java Lambda(二)
- Linux中的解压与压缩