当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

6431:Problem F. NewNippori

题目描述
Given a connected undirected graph with n nodes and m edges, the capacity of each edge is 1.
Define maxflow(s, t) as the maxflow from s to t.
Calculate
n i-1
∑ ∑ min(maxflow(i, j), 3)
i=1 j=1
输入解释
The first line of the input contains an integer T , denoting the number of test cases.
In each test case, there are two integers n, m in the first line, denoting the number of vertices and edges of the graph.
Then followed m lines, each line contains two integers ui, vi, denoting an undirected edge (ui, vi).
1 ≤ T ≤ 20, 1 ≤ n ≤ 100000, 0 ≤ m ≤ 300000, ∑ n ≤ 400000, ∑ m ≤ 700000, ui不等于vi
输出解释
For each test case, output one line contains a single integer, denoting the answer.
输入样例
1
5 7
1 4
1 2
2 3
2 3
3 4
4 5
4 5
输出样例
21
来自杭电HDUOJ的附加信息
Recommend chendu

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-6431

最后修改于 2020-10-25T23:31:17+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
6000/3000MS(Java/Others) 524288/524288K(Java/Others)