ACM-ICPC 2018 沈阳赛区网络预赛 F- 有源汇上下界可行流

题目链接:点击这里

关于上下界网络流

解题思路:

将二分图的点变成边,也就是新建一个点唯一指向原来的点,使得新建的与原来的一一对应.这样经过原来的点就必须经过新建点与原来点的边,也就将点变成了边,直接在建立源点S，汇点T,使其变为有源汇上下界网络流.

之后就是对其求是否有可行流了.

 

#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1e4;
const int maxm = 50010;
struct node
{
    int v, cap, next;
} E[maxm];
int head[maxn], tot;
int d[maxn], tep[maxn], q[maxn];
void init()
{
    memset(head, -1, sizeof(head));
    tot = 0;
}
void add(int u, int v, int cap)
{
    E[tot] = {v, cap, head[u]};
    head[u] = tot++;
    E[tot] = {u, 0, head[v]};
    head[v] = tot++;
}
bool bfs(int st, int en, int ws)
{
    int i, u, v, he, tail;
    for(i = 0; i <= ws; i++) d[i] = -1;
    he = tail = 0;
    d[st] = 0;
    q[tail] = st;
    while(he <= tail)
    {
        u = q[he++];
        for(i = head[u]; i + 1; i = E[i].next)
        {
            v = E[i].v;
            if(d[v] == -1 && E[i].cap > 0)
            {
                d[v] = d[u] + 1;
                q[++tail] = v;
            }
        }
    }
    return (d[en] != -1);
}
int dfs(int u, int en, int f)
{
    if(u == en || f == 0) return f;
    int flow = 0, temp;
    for(; tep[u] + 1; tep[u] = E[tep[u]].next)
    {
        node& e = E[tep[u]];
        if(d[u] + 1 == d[e.v])
        {
            temp = dfs(e.v, en, min(f, e.cap));
            if(temp > 0)
            {
                e.cap -= temp;
                E[tep[u] ^ 1].cap += temp;
                flow += temp;
                f -= temp;
                if(f == 0)  break;
            }
        }
    }
    return flow;
}
int dinic(int st, int en, int ws)
{
    int i, ans = 0;
    while(bfs(st, en, ws))
    {
        for(i = 0; i <= ws; i++) tep[i] = head[i];
        ans += dfs(st, en, inf);
    }
    return ans;
}
int du[maxn],L,R,K;
int n,m,s,t;
int main()
{
	int ca = 1;
    while(~scanf("%d%d",&n,&m)){
    	scanf("%d%d%d",&K,&L,&R);
	    init();
	    int sum = 0; 
	    s = 0,t = 2*(n+m)+1;
	    memset(du,0,sizeof(du));
	    for(int i=1;i<=n;i++){
	    	add(s,n+i,inf);
			add(n+i,i,R-L);
			du[n+i] -= L;
			du[i] += L;
		}
		for(int i=1;i<=m;i++){
			add(2*n+m+i,2*n+i,R-L);
			add(2*n+i,t,inf);
			du[2*n+m+i] -= L;
			du[2*n+i] += L;
		}
	    for(int i=1; i<=K; i++){
	        int u,v,l,r;
	        scanf("%d %d", &u,&v);
	        add(u,2*n+m+v,1);
	    }
	    n = t;
	    int ss = n+1, tt = n+2;
	    for(int i=0; i<=t; i++){
	        if(du[i]>0) sum+=du[i],add(ss,i,du[i]);
	        if(du[i]<0) add(i,tt,-du[i]);
	    }
	    add(t, s, inf);
	    printf("Case %d: ",ca++);
	    if(sum == dinic(ss,tt,n+2)) puts("Yes");
	    else puts("No");
	}
    return 0;
}