HDU 6090 Rikka with Graph - 2017多校联盟5 第6题

Rikka with Graph

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

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

1
4 5

Sample Output

/*
n个点，你可以连接任意<=m条边，得到图G
wG = ∑ ∑ dist(i,j) 其中(ij都是从1到n)
dis(i,j)定义为从i到j经过的边的个数。如果不通，则定义为n
问 怎么连边能让wG最小，最小的wg是多少

题解
1.肯定是边越多越好，所以在不超过完全图的边的个数情况下，边的条数尽可能大,
如果超过完全图的边数即m>=n(n-1)/2，那么变成完全图，即答案是n(n-1)
2.否则有两种情况
(1).m>=n-1
如果图恰好能组成深度为2的树（根节点算一层），那么根节点和剩下n-1个点距离是1
剩余n-1个节点之间距离互相都是2,此时这棵树的WG=2*((n-1)+2*C(n-1,2))其中C(,)表示组合
当然没有那么多恰好,组成一棵树用n-1条边,那么剩下m-(n-1)条边当然是连在距离为2的点间最好
那么此时这棵树的WG=2*( (n-1) + 2*C(n-1,2)- (m-(n-1)) ) = 2*（n^2-n-m）
(2).m<n-1
即无法组成连通图，那么使用m条边，x=m+1个点按照前一种情况组成一棵树，这棵树的WG1 = 2*(x-1)^2
余下的点之间都是不通的都是n。组成树的这x个点和其余n-x个点距离和是 WG2=n*x*(n-x),
未组成树的n-x个点和除自己之外每个点距离和是WG3=n*(n-x)*(n-1)，故WG =WG1+WG2+WG3
*/

#include <iostream>
#include <cstdio>
using namespace std;

typedef long long LL;

LL n, m;

int main()
{
   LL t;

    cin >> t;
    while (t > 0){
        t--;

        cin >> n >> m;
        LL ans = 0;

       if(m>=(n*(n-1))/2) ans = n*(n-1);
        else if (m >= n-1){
            ans = 2*(n*n - n - m);
        }
        else{
            LL x = m + 1;
            ans = 2*(x-1)*(x-1) + n*x*(n-x)+n*(n-x)*(n-1);
    }
    cout << ans << endl;

    }
    return 0;
}