同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

21716_FlowProble

2022-5-16 18:20| 发布者: Hocassian| 查看: 22| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-4-89505786889500-Problem List-采集的数据-后羿采集器.html

Pro.ID

21716

Title

Flow Problem

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=21716

AC

Submit

Ratio

100.00%

时间&空间限制

Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

描述

Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.

输入

The first line of input contains an integer T, denoting the number of test cases.

For each test case, the first line contains two integers N and M, denoting the number of vertexes and edges in the graph. (2 ≤ N ≤ 15, 0 ≤ M ≤ 1000)

Next M lines, each line contains three integers X, Y and C, there is an edge from X to Y and the capacity of it is C. (1 ≤ X, Y ≤ N, 1 ≤ C ≤ 1000)

输出

Description

Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.

Input

The first line of input contains an integer T, denoting the number of test cases.

For each test case, the first line contains two integers N and M, denoting the number of vertexes and edges in the graph. (2 ≤ N ≤ 15, 0 ≤ M ≤ 1000)

Next M lines, each line contains three integers X, Y and C, there is an edge from X to Y and the capacity of it is C. (1 ≤ X, Y ≤ N, 1 ≤ C ≤ 1000)

Output

For each test cases, you should output the maximum flow from source 1 to sink N.

Sample Input

2
3 2
1 2 1
2 3 1
3 3
1 2 1
2 3 1
1 3 1

Sample Output

Case 1: 1
Case 2: 2

Source

HyperHexagon's Summer Gift

样例输入