Rikka with Graph
来源:互联网 发布:淘宝u站申请入口 编辑:程序博客网 时间:2024/05/29 13:28
Rikka with Graph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 546 Accepted Submission(s): 332
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
14 5
Sample Output
14
#include<iostream>#include<cstdio>using namespace std;int main(){ int t; scanf("%d",&t); while (t--) { long long n, m; scanf("%lld %lld",&n,&m); if(n*(n-1)/2<=m) { printf("%lld\n",n*(n-1)); continue; } long long ans=n*(n-1); if(m>=(n-1)) { ans+=2*(n*(n-1)/2-m); } else { ans =2*m*m+(m*n+n*n)*(n-1-m); } printf("%lld\n",ans); } return 0;}
- Rikka with Graph
- Bc Rikka with Graph
- Rikka with Graph<hdoj5631>
- Rikka with Graph HDU
- HDU5631 Rikka with Graph
- Rikka with Graph||HDU5631
- Rikka with Graph
- HDU5631 Rikka with Graph
- HDU6090 Rikka with Graph
- HDU6090 Rikka with Graph
- HDU6090 Rikka with Graph
- hdu6090 Rikka with Graph
- Rikka with Graph
- Rikka with Graph
- hdu6090 Rikka with Graph
- HDU6090-Rikka with Graph
- hdu 5422 Rikka with Graph
- HDU 5422:Rikka with Graph
- 各种字节转换为byte(ConvertCodeUtility)工具类
- php同个用户同时只能登陆一个, 后登陆者踢掉前登陆者
- pandas索引和选择
- js 页面6秒倒计时,自动退出登录功能。
- MyBatis高级
- Rikka with Graph
- 快速掌握“抽象类“和“接口”
- 使用awk求指定列的最大值最小值
- python-opencv的使用
- Peaceful Commission (2—SAT入门题)
- NYOJ 36-最长公共子序列
- java 浅克隆与深克隆
- Spring MVC 配置报错: Error creating bean with name 'userController': Injection of resource dependencies
- 知道这20个正则表达式,能让你少写1,000行代码