hdu6090 数学思维+完全图+星形图的了解

最新推荐文章于 2022-11-24 13:55:07 发布

NicoleYWJ

最新推荐文章于 2022-11-24 13:55:07 发布

阅读量471

点赞数

本文链接：https://blog.csdn.net/NicoleYWJ/article/details/77011876

版权

Rikka with Graph

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 658 Accepted Submission(s): 385

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

Sample Output

Source

2017 Multi-University Training Contest - Team 5

思路：

要距离最短的方式应该是尽量为完全图的形式，所以分类判断当可以构成完全图的情况，不行的话，就以星星图为标准来计算。

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
int main()
{
	ll t,n,m,ans;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lld%lld",&n,&m);
		if(m>=n*(n-1)/2)
			printf("%lld\n",n*(n-1));
		else if(m>=n-1)
			printf("%lld\n",2*(n-1)*(n-1)-2*(m-n+1));
		else printf("%lld\n",2*m*m+(n-m-1)*(m+1)*n*2+(n-m-1)*(n-m-2)*n);
	}
}