HDU 3549 Flow Problem
来源:互联网 发布:淘宝微淘标题写什么 编辑:程序博客网 时间:2024/06/06 00:19
Problem 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)
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
23 21 2 12 3 13 31 2 12 3 11 3 1
Sample Output
Case 1: 1Case 2: 2网络流模板题,先来一发dinic的#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<algorithm>#include<queue>using namespace std;const int maxn = 1e5 + 10;int T, n, m, z = 0;struct MaxFlow{ struct Edges { int end, flow; Edges(){} Edges(int end, int flow) :end(end), flow(flow){} }edge[maxn]; int first[maxn], next[maxn], dis[maxn], tot; void clear(){ tot = 0; memset(first, -1, sizeof(first)); } void AddEdge(int s, int t, int flow) { edge[tot] = Edges(t, 0); next[tot] = first[s]; first[s] = tot++; edge[tot] = Edges(s, flow); next[tot] = first[t]; first[t] = tot++; } bool bfs(int s, int t) { memset(dis, -1, sizeof(dis)); queue<int> p; p.push(s); dis[s] = 0; while (!p.empty()) { int q = p.front(); p.pop(); for (int i = first[q]; i >= 0; i = next[i]) { if (edge[i ^ 1].flow&&dis[edge[i].end] == -1) { p.push(edge[i].end); dis[edge[i].end] = dis[q] + 1; } } } return dis[t] != -1; } int dfs(int s, int t, int low) { if (s == t) return low; for (int i = first[s]; i >= 0; i = next[i]) { if (dis[s] + 1 == dis[edge[i].end] && edge[i ^ 1].flow) { int x = dfs(edge[i].end, t, min(low, edge[i ^ 1].flow)); if (x) { edge[i].flow += x; edge[i ^ 1].flow -= x; return x; } } } return 0; } int dinic(int s, int t) { int maxflow = 0, inc = 0; while (bfs(s, t)) while (inc = dfs(s, t, 0x7FFFFFFF)) maxflow += inc; return maxflow; }}solve;int main(){ scanf("%d", &T); while (T--) { scanf("%d%d", &n, &m); int s, t, flow; solve.clear(); while (m--) { scanf("%d%d%d", &s, &t, &flow); solve.AddEdge(s, t, flow); } printf("Case %d: %d\n", ++z, solve.dinic(1, n)); } return 0;}
0 0
- HDU 3549 Flow Problem
- hdu 3549 Flow Problem
- hdu 3549 Flow Problem
- hdu 3549 Flow Problem
- HDU 3549 Flow Problem
- hdu(3549)Flow Problem
- HDU 3549 Flow Problem
- hdu 3549 Flow Problem
- HDU 3549 Flow Problem
- HDU 3549 Flow Problem
- HDU 3549 Flow Problem
- HDU 3549 Flow Problem
- HDU 3549 Flow Problem
- HDU 3549 Flow Problem
- hdu 3549 Flow Problem
- hdu 3549Flow Problem
- HDU 3549 Flow Problem
- hdu 3549 Flow Problem
- map.entry 的作用
- 杭电题库刷题记录2015
- 欢迎使用CSDN-markdown编辑器
- Facebook的Web开发三板斧:React.js、Relay和GraphQL
- Android Unable to resolve target 'android-X' 解决方法
- HDU 3549 Flow Problem
- 【自语】如何前后端的web及移动都打通?
- iOS日常需求:iOS app实现检测更新功能
- 腾讯云机器故障买错了退货该怎么办
- JEB(android app逆向)
- 【设计模式】——代理模式
- HYSBZ/BZOJ 1005 [HNOI2008] 明明的烦恼 - Prufer编码&组合数学&高精度 此乃神题!
- Light OJ 1037 Agent 47 (状压DP)
- github发布开源项目代码教程