F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Problem F. NewNippori

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 116    Accepted Submission(s): 26


Problem Description
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
 

Input
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
 

Output
For each test case, output one line contains a single integer, denoting the answer.
 

Sample Input
1 5 7 1 4 1 2 2 3 2 3 3 4 4 5 4 5
 

Sample Output
21
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-03-29 04:37:43, Gzip enabled