无源无汇上下界网络流（循环流） ZOJ 2314 Reactor Cooling

最新推荐文章于 2024-01-06 17:21:40 发布

BlackJack_

最新推荐文章于 2024-01-06 17:21:40 发布

阅读量687

点赞数 2

分类专栏： —————————网络流上下界网络流

本文链接：https://blog.csdn.net/blackjack_/article/details/77747136

版权

—————————网络流同时被 2 个专栏收录

47 篇文章 0 订阅

订阅专栏

上下界网络流

5 篇文章 0 订阅

订阅专栏

今天考试有上下界。。。昨天晚上本来想写的。。。结果没写就GG了。。。

开始学习上下界网络流

进程参考衡水大佬liu_renda

开始初步学习辣~

先来看题

Reactor Cooling

Time Limit: 5 Seconds Memory Limit: 32768 KB Special Judge

The terrorist group leaded by a well known international terrorist Ben Bladen is buliding a nuclear reactor to produce plutonium for the nuclear bomb they are planning to create. Being the wicked computer genius of this group, you are responsible for developing the cooling system for the reactor.

The cooling system of the reactor consists of the number of pipes that special cooling liquid flows by. Pipes are connected at special points, called nodes, each pipe has the starting node and the end point. The liquid must flow by the pipe from its start point to its end point and not in the opposite direction.

Let the nodes be numbered from 1 to N. The cooling system must be designed so that the liquid is circulating by the pipes and the amount of the liquid coming to each node (in the unit of time) is equal to the amount of liquid leaving the node. That is, if we designate the amount of liquid going by the pipe from i-th node to j-th as f_ij, (put f_ij = 0 if there is no pipe from node i to node j), for each i the following condition must hold:

f _i,1+f _i,2+...+f _i,N = f _1,i+f _2,i+...+f _N,i

Each pipe has some finite capacity, therefore for each i and j connected by the pipe must be f_ij <= c_ij where cij is the capacity of the pipe. To provide sufficient cooling, the amount of the liquid flowing by the pipe going from i-th to j-th nodes must be at least l_ij, thus it must be f_ij>= l_ij.

Given cij and l_ij for all pipes, find the amount f_ij, satisfying the conditions specified above.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Input

The first line of the input file contains the number N (1 <= N <= 200) - the number of nodes and and M - the number of pipes. The following M lines contain four integer number each - i, j, lij and cij each. There is at most one pipe connecting any two nodes and 0 <= l_ij <= c_ij <= 10^5 for all pipes. No pipe connects a node to itself. If there is a pipe from i-th node to j-th, there is no pipe from j-th node to i-th.

Output

On the first line of the output file print YES if there is the way to carry out reactor cooling and NO if there is none. In the first case M integers must follow, k-th number being the amount of liquid flowing by the k-th pipe. Pipes are numbered as they are given in the input file.

Sample Input

2

4 6
1 2 1 2
2 3 1 2
3 4 1 2
4 1 1 2
1 3 1 2
4 2 1 2

4 6
1 2 1 3
2 3 1 3
3 4 1 3
4 1 1 3
1 3 1 3
4 2 1 3

Sample Input

NO

YES
1
2
3
2
1
1

表示并不懂英文。。

就是裸的无源无汇网络流（循环流）询问是否有解

有解的话输出一个可行流

首先我们要假设自己已经掌握了所有前置技能（dinic就够了）

之后要肿么办呢？

随手YY一下

：有没有解先不管，把上界减下界跑最大流是不是就差不多了啊:(

当然是啊

已经连完了剪掉下界的残量网络

所以我们需要考虑的就是如何解决下界

由于下界并不相同，在直接剪掉后无法保证下界已经流量平衡

那么就要让它强行平衡

怎么搞呢

既然这里的流量不平衡

那么我们就可以利用网络流中的源汇来令其平衡

我们在下界网络中对流入流出量进行记录

看一看这个点得到的流量是多是少

需要的多就从S给，有多余的就给T

最后跑一遍S->T的最大流，看能否满流就好了

由于BJ巨懒，脑小又不想多写，可能讲的不好

如果没有明白，真是抱歉浪费了您的时间

为您推荐dalao blog

#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<set>
#include<map>
using namespace std;

typedef long long ll;

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x*f;
}
void print(int x)
{if(x<0)x=-x,putchar('-');if(x>=10)print(x/10);putchar(x%10+'0');}

const int N=210,M=100100,inf=-0X3f3f3f3f;

int m,n,S=N-2,T=N-1;

int ecnt=1,last[N];
struct EDGE{int to,nt,val;}e[M];
inline void readd(int u,int v,int val)
{e[++ecnt]=(EDGE){v,last[u],val};last[u]=ecnt;}
inline void add(int u,int v,int val)
{readd(u,v,val);readd(v,u,0);}

int in[N],low[M];

void initial()
{ecnt=1;memset(last,0,sizeof(last));memset(in,0,sizeof(in));}

int d[N],q[N];

bool bfs()
{
	memset(d,0,sizeof(d));memset(q,0,sizeof(q));
	register int i,u,head=0,tail=1;
	q[0]=S;d[S]=1;
	while(head<tail)
	{
		u=q[head++];
		for(i=last[u];i;i=e[i].nt)if(e[i].val&&!d[e[i].to])
		{
			d[e[i].to]=d[u]+1;
			q[tail++]=e[i].to;
		}
	}
	return d[T];
}

int dfs(int u,int lim)
{
	if(T==u||!lim)return lim;
	int res=0,tmp;
	for(int i=last[u];i;i=e[i].nt)if(e[i].val&&d[e[i].to]==d[u]+1)
	{
		tmp=dfs(e[i].to,min(lim,e[i].val));
		e[i].val-=tmp;e[i^1].val+=tmp;res+=tmp;lim-=tmp;
		if(!tmp)d[e[i].to]=-1;if(!lim)break;
	}
	return res;
}

void dinic()
{while(bfs())dfs(S,inf);}

void build()
{for(int i=1;i<=n;++i)in[i]>0?add(S,i,in[i]):add(i,T,-in[i]);}

inline bool check()
{for(int i=last[S];i;i=e[i].nt)if(e[i].val)return 0;return 1;}

int main()
{
	int T=read();
	register int i,u,v,val;
	while(T--)
	{
		n=read();m=read();
		initial();
		for(i=1;i<=m;++i)
		{
			u=read();v=read();low[i]=read();val=read();
			in[u]-=low[i];in[v]+=low[i];
			add(u,v,val-low[i]);
		}
		build();dinic();
		if(!check()){puts("NO");puts("");continue;}
		puts("YES");
		for(i=1;i<=m;++i)print(e[(i<<1)^1].val+low[i]),puts("");
		puts("");
	}
	return 0;
}
/*
2
4 6
1 2 1 2
2 3 1 2
3 4 1 2
4 1 1 2
1 3 1 2
4 2 1 2
4 6
1 2 1 3
2 3 1 3
3 4 1 3
4 1 1 3
1 3 1 3
4 2 1 3

NO

YES
1
2
3
2
1
1

*/