HDU 6090 Rikka with Graph【规律】
来源:互联网 发布:d3d11游戏编程 pdf 编辑:程序博客网 时间:2024/05/22 21:30
Rikka with Graph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 548 Accepted Submission(s): 334
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
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<queue>#include<stack>#include<vector>#include<map>#include<set>#include<algorithm>using namespace std;#define ll long long#define ms(a,b) memset(a,b,sizeof(a))#define maxn 510const int M=1e6+10;const int MM=2e3+10;const int inf=0x3f3f3f3f;const int mod=998244353;const double eps=1e-10;ll n,m;int main(){ int t; scanf("%d",&t); while(t--){ scanf("%lld%lld",&n,&m); ll sum=n*(n-1); ll ans=0,sum2=0,sum1=0; if(m<=n-1){ sum1=m*2; sum2=(n-m-1)*((m+1)*2+(n-m-2)); ans=sum1*1+sum2*n+(sum-sum1-sum2)*2; } else { m=min(m,n*(n-1)/2); sum1=m*2; ans=sum1*1+(sum-sum1)*2; } printf("%lld\n",ans); } return 0;}
阅读全文
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
- 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
- HDU 6090-Rikka with Graph
- CANVAS绘制虚线和圆点虚线
- 一件Mac过期的二货事情
- OpenCV中的数据类型
- mybatis mapper逆向生成代码结构以及作用
- SELinux基本概念及基本配置
- HDU 6090 Rikka with Graph【规律】
- 欢迎使用CSDN-markdown编辑器
- 操作系统-内存管理机制
- 冒泡和捕获:事件代理
- UESTC1724 为了我们心爱的京电(欧拉函数)
- hdu-2846-Repository(字典树)
- CodeForces 746B Decoding
- 第三方登录集成步骤
- OpenCV学习笔记(5)——normalize函数