HDU 4289 Control(最小割)
来源:互联网 发布:知乎怎么看题主 编辑:程序博客网 时间:2024/06/04 19:01
。。。开的DP专题里面不知道为什么混杂了这题- -, 很明显的最小割,由于是点有权值,那么拆点最小割即可
代码:
#include <cstdio>#include <cstring>#include <queue>#include <algorithm>using namespace std;const int MAXNODE = 405;const int MAXEDGE = 100005;typedef int Type;const Type INF = 0x3f3f3f3f;struct Edge {int u, v;Type cap, flow;Edge() {}Edge(int u, int v, Type cap, Type flow) {this->u = u;this->v = v;this->cap = cap;this->flow = flow;}};struct Dinic {int n, m, s, t;Edge edges[MAXEDGE];int first[MAXNODE];int next[MAXEDGE];bool vis[MAXNODE];Type d[MAXNODE];int cur[MAXNODE];vector<int> cut;void init(int n) {this->n = n;memset(first, -1, sizeof(first));m = 0;}void add_Edge(int u, int v, Type cap) {edges[m] = Edge(u, v, cap, 0);next[m] = first[u];first[u] = m++;edges[m] = Edge(v, u, 0, 0);next[m] = first[v];first[v] = m++;}bool bfs() {memset(vis, false, sizeof(vis));queue<int> Q;Q.push(s);d[s] = 0;vis[s] = true;while (!Q.empty()) {int u = Q.front(); Q.pop();for (int i = first[u]; i != -1; i = next[i]) {Edge& e = edges[i];if (!vis[e.v] && e.cap > e.flow) {vis[e.v] = true;d[e.v] = d[u] + 1;Q.push(e.v);}}}return vis[t];}Type dfs(int u, Type a) {if (u == t || a == 0) return a;Type flow = 0, f;for (int &i = cur[u]; i != -1; i = next[i]) {Edge& e = edges[i];if (d[u] + 1 == d[e.v] && (f = dfs(e.v, min(a, e.cap - e.flow))) > 0) {e.flow += f;edges[i^1].flow -= f;flow += f;a -= f;if (a == 0) break;}}return flow;}Type Maxflow(int s, int t) {this->s = s; this->t = t;Type flow = 0;while (bfs()) {for (int i = 0; i < n; i++)cur[i] = first[i];flow += dfs(s, INF);}return flow;}void MinCut() {cut.clear();for (int i = 0; i < m; i += 2) {if (vis[edges[i].u] && !vis[edges[i].v])cut.push_back(i);}}} gao;int n, m, s, t;int main() {while (~scanf("%d%d", &n, &m)) {scanf("%d%d", &s, &t);gao.init(2 * n + 2);int u, v; for (int i = 1; i <= n; i++) { scanf("%d", &u); gao.add_Edge(i, i + n, u); } while (m--) { scanf("%d%d", &u, &v); gao.add_Edge(u + n, v, INF); gao.add_Edge(v + n, u, INF); } printf("%d\n", gao.Maxflow(s, t + n)); }return 0;}
0 0
- HDU 4289 Control(最小割)
- HDU 4289 Control(最小割)
- 【最小割】HDU 4289 Control
- hdu 4289 Control (最小割)
- HDU 4289 Control (网络流-最小割)
- HDU 4289 Control (最小割 拆点)
- HDU 4289 Control(最大流、最小割)
- HDU 4289 Control (最大流最小割)
- hdu 4289 Control(图论-最小割)
- hdu 4289 Control 最小割 isap
- hdu 4289 Control (最小割 sap)
- HDU - 4289 Control (最小割 MCMF)
- hdu 4289 Control【最小割+拆点】
- HDU 4289--Control【最小割 && 拆点】
- 最大流最小割-HDU-4289-Control
- hdu 4289 Control (成都网络赛最小割)
- hdu 4289 Control 网络流,最小割,拆点
- HDU 4289 Control 最小割最大流 拆点
- spark1.2.0源码MLlib-线性回归
- Android----蓝牙通信使用 不同手机下同一应用通信
- windows bat批处理函数
- const常量与宏定义区别
- 以jetty做容器,数据在传输过程中出现乱码
- HDU 4289 Control(最小割)
- spark streaming NotSerializableException
- js 插入到外面
- 罗德施瓦茨R&S FSV型号频谱仪解调方法
- thinkphp上传文件
- ZooKeeper集群搭建
- 使用广播销毁多个Activity
- 河北活塞洗煤机_复合式干法洗煤机特点由于风力作用在分选过程中可去除一定比
- TCP拥塞控制算法 优缺点 适用环境 性能分析