hdu 6090 Rikka with Graph(找规律)
2017-08-11 09:07
357 查看
Rikka with Graph
题目链接:Rikka with Graph题意:给你n个顶点,让你最多建m条边,如果顶点i和顶点j连通,则他们之间的权值为最短路上边的数量,否则他们之间的权值则为n
求∑ni=1∑nj=1dist(i,j)
思路:只要想到把这张图建成这样的,直接找规律就行了
官方题解:
代码:
#include<bits/stdc++.h> using namespace std; typedef long long LL; int main() { int t; LL n,m,ans; scanf("%d",&t); while(t--) { scanf("%lld%lld",&n,&m); if(m<n-1) ans=n*n*(n-1)-2*(n-1)*m-(n-2)*m*(m-1); else ans=(n*(n-1)-m)*2; if(ans<n*(n-1)) ans=n*(n-1); printf("%lld\n",ans); } return 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 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(找规律)
- hdu 6090 Rikka with Graph(找规律)
- hdu 6090 Rikka with Graph(找规律)
- hdu 6090-Rikka with Graph
- HDU_6090 Rikka with Graph 【贪心】