练习记录(网络流入门)

uva11082
没有想法，看了紫书的解析。先把矩阵每一个元素-1，这样每个元素取值范围变为0~19，这样就允许了0流量的存在。把所有行的和x1,x2…xr,列的和y1,y2,…yc看为节点源点于所有行和节点相连，容量为x[i]-c;列和节点于汇点相连，容量为y[i]-r;每个x节点在与所有y节点相连，容量为19，跑最大流。则xi于yj边的流量变为 A[i][j]-1.可以这样理解每一行的和可以由不同列的元素构成，只要与源点和汇点相连的边都满载，即说明在满足行和列和一定的条件下有解。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<queue>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<stack>
#include<map>
using namespace std;
typedef long long ll;
const int maxn=40+5;
const int inf=1e9;
int d[maxn],cur[maxn];
bool vis[maxn];
struct edge
{
    int from,to,cap,flow;
    edge(int from,int to,int cap,int flow=0):from(from),to(to),cap(cap),flow(flow){}
};
vector<int>mp[maxn];
vector<edge> edges;
void addedge(int from,int to,int cap,int flow=0)
{
    edges.push_back(edge(from,to,cap,flow));
    edges.push_back(edge(to,from,0,-flow));
    int m=edges.size();
    mp[from].push_back(m-2);
    mp[to].push_back(m-1);
}

queue<int> op;
struct Dinic
{
    int s,t;
    //Dinic(int s,int t):s(s),t(t){}
    void init()
    {
        for(int i=0;i<maxn;i++) mp[i].clear();
        edges.clear();
    }

    bool bfs()
    {
        memset(vis,0,sizeof(vis));
        op.push(s);d[s]=0;vis[s]=1;
        while(!op.empty())
        {   
            int x=op.front();op.pop();
            for(int i=0;i<mp[x].size();i++)
            {
                edge& e=edges[mp[x][i]];
                if(!vis[e.to]&&e.cap>e.flow)
                {
                    vis[e.to]=1;
                    d[e.to]=d[x]+1;
                    op.push(e.to);
                }
            }

        }
        return vis[t];//若为0,则已无增广路
    }

    int dfs(int x,int a)
    {
        if(x==t||a==0) return a;
        int flow=0,f;
        for(int &i=cur[x];i<mp[x].size();i++)//从上次考虑过的边开始
        {
            edge& e=edges[mp[x][i]];
            if(d[x]+1==d[e.to]&&(f=dfs(e.to,min(a,e.cap-e.flow)))>0)
            {
                e.flow+=f;
                edges[mp[x][i]^1].flow-=f;
                flow+=f;
                a-=f;
                if(a==0) break;
            }
        }
        return flow;
    }

    int maxflow(int s,int t)
    {
        this->s=s;this->t=t;
        int flow=0;
        while(bfs())
        {
            memset(cur,0,sizeof(cur));
            flow+=dfs(s,inf);
        }

        return flow;
    }
};
int x[maxn],y[maxn];
int main()
{
    //freopen("tte.txt","r",stdin);
    int t;scanf("%d",&t);
    Dinic solve;
    const int st=41,ed=42;
    int kase=0;
    while(t--)
    {
        int r,c;
        scanf("%d%d",&r,&c);
        solve.init();
        for(int i=1;i<=r;i++) 
        {
            scanf("%d",&x[i]);
        }
        for(int i=r;i>=1;i--) x[i]-=x[i-1];
        for(int i=1;i<=c;i++)
        {
            scanf("%d",&y[i]);
        }
        for(int i=c;i>=1;i--) y[i]-=y[i-1];
        for(int i=1;i<=r;i++)
        {
            addedge(st,i,x[i]-c,0);
        }
        for(int i=1;i<=c;i++)
        {
            addedge(r+i,ed,y[i]-r,0);
        }
        for(int i=1;i<=r;i++)
        {
            for(int j=r+1;j<=r+c;j++)
            {
                addedge(i,j,19,0);
            }
        }
        solve.maxflow(st,ed);
        printf("Matrix %d\n",++kase);
        for(int i=1;i<=r;i++)
        {
            for(int j=0;j<mp[i].size();j++)
            {
                edge &e=edges[mp[i][j]];
                if(e.to==st) continue;
                printf("%d%c",e.flow+1,j==mp[i].size()-1?'\n':' ');
            }
        }
        printf("\n");
    }
    return 0;
}