zoj 2314 Reactor Cooling 无源汇网络流
来源:互联网 发布:淘宝回收手机被骗了 编辑:程序博客网 时间:2024/05/16 08:13
终于知道什么是无源汇网络流的题了。。。
#include<iostream>
#include<algorithm>
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
int dir[4][2]={0,1,0,-1,1,0,-1,0};
int n,m;
int c[305];
int lo[50000];
const int maxnode = 300 + 5;
const int maxedge = 2*50000 + 5;
const int oo = 1000000000;
int node, src, dest, nedge;
int head[maxnode], point[maxedge], next1[maxedge], flow[maxedge], capa[maxedge];//point[x]==y表示第x条边连接y,head,next为邻接表,flow[x]表示x边的动态值,capa[x]表示x边的初始值
int dist[maxnode], Q[maxnode], work[maxnode];//dist[i]表示i点的等级
void init(int _node, int _src, int _dest){//初始化,node表示点的个数,src表示起点,dest表示终点
node = _node;
src = _src;
dest = _dest;
for (int i = 0; i < node; i++) head[i] = -1;
nedge = 0;
}
void addedge(int u, int v, int c1, int c2){//增加一条u到v流量为c1,v到u流量为c2的两条边
point[nedge] = v, capa[nedge] = c1, flow[nedge] = 0, next1[nedge] = head[u], head[u] = (nedge++);
point[nedge] = u, capa[nedge] = c2, flow[nedge] = 0, next1[nedge] = head[v], head[v] = (nedge++);
}
bool dinic_bfs(){
memset(dist, 255, sizeof (dist));
dist[src] = 0;
int sizeQ = 0;
Q[sizeQ++] = src;
for (int cl = 0; cl < sizeQ; cl++)
for (int k = Q[cl], i = head[k]; i >= 0; i = next1[i])
if (flow[i] < capa[i] && dist[point[i]] < 0){
dist[point[i]] = dist[k] + 1;
Q[sizeQ++] = point[i];
}
return dist[dest] >= 0;
}
int dinic_dfs(int x, int exp){
if (x == dest) return exp;
for (int &i = work[x]; i >= 0; i = next1[i]){
int v = point[i], tmp;
if (flow[i] < capa[i] && dist[v] == dist[x] + 1 && (tmp = dinic_dfs(v, min(exp, capa[i] - flow[i]))) > 0){
flow[i] += tmp;
flow[i^1] -= tmp;
return tmp;
}
}
return 0;
}
int dinic_flow(){
int result = 0;
while (dinic_bfs()){
for (int i = 0; i < node; i++) work[i] = head[i];
while (1){
int delta = dinic_dfs(src, oo);
if (delta == 0) break;
result += delta;
}
}
return result;
}
//建图前,运行一遍init();
//加边时,运行addedge(a,b,c,0),表示点a到b流量为c的边建成(注意点序号要从0开始)
//求解最大流运行dinic_flow(),返回值即为答案
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
int i,j;
int ta,tb,tc,td,sum=0;;
init(n+2,0,n+1);
memset(c,0,sizeof(c));
for(i=1;i<=m;i++)
{
scanf("%d%d%d%d",&ta,&tb,&tc,&td);
lo[i]=tc;
addedge(ta,tb,td-tc,0);
c[ta]-=tc;
c[tb]+=tc;
}
for(i=1;i<=n;i++)
{
if(c[i]>0)
{
addedge(0,i,c[i],0);
sum+=c[i];
}
else if(c[i]<0)
addedge(i,n+1,-c[i],0);
}
int ans;
ans=dinic_flow();
if(ans==sum)
{
printf("YES\n");
for(i=0;i<m;i++)
printf("%d\n",flow[i*2]+lo[i+1]);
}
else
printf("NO\n");
}
return 0;
}
- ZOJ 2314 Reactor Cooling 无源汇上下界网络流
- zoj 2314 Reactor Cooling 无源汇网络流
- ZOJ 2314 Reactor Cooling 无源汇上下界可行流
- ZOJ--2314--Reactor Cooling【无源汇上下界可行流】
- ZOJ 2314 Reactor Cooling 上下界网络流(无源汇可行流)
- ZOJ 2314Reactor Cooling 无源汇上下界网络流 可行流
- 【无源汇有上下界可行流】ZOJ-2314 Reactor Cooling
- zoj 2314 reactor cooling(无源汇有上下界可行流)
- 无源无汇上下界网络流(循环流) ZOJ 2314 Reactor Cooling
- zoj 2314 Reactor Cooling(无源汇上下界可行流)
- zoj 2314 Reactor Cooling(无源汇上下界的可行流)
- 【zoj2314】Reactor Cooling 无源汇可行流)
- zoj 2314 Reactor Cooling--无源汇有上下界最大流--递归sap
- zoj 2314 Reactor Cooling (无源汇有上下界的可行流)
- sgu 194 Reactor Cooling 无源无汇上下限网络流
- sgu 194. Reactor Cooling (无源无汇上下界网络流)
- [ZOJ2314]/[SGU194] Reactor Cooling 无源汇有上下界网络流
- zoj 2314 Reactor Cooling (有上下界的网络流)
- 余弦距离、欧氏距离和杰卡德相似性度量的对比分析
- 闲评好声音齐秦及汪峰组决赛
- 求两个字符串的交集
- makefile 之多目录,多目标编译
- Objective-c中的占位符,打印BOOL类型数据
- zoj 2314 Reactor Cooling 无源汇网络流
- struts2文件下载
- 51Nod 1163 最高的奖励 并查集&贪心
- 大数模板
- ACdream 1210 Chinese Girls' Amusement
- Android应用开发-小巫CSDN博客客户端Jsoup篇
- Verilog数据类型
- LinkedHashMap中根据value读取key值
- POJO概述