hdu 4888

网络流建模，建模不难，难在找环；

#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
#define inf 1<<30
#define maxn 2100
using namespace std;

struct edge
{
    int from,to,cap,flow;
    edge(int from,int to,int cap,int flow):from(from),to(to),cap(cap),flow(flow) {}
};

struct dinic
{
    int n,m,s,t;
    vector<edge>edges;
    vector<int>g[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];
    bool ishuan[maxn];
    int jie[][];

    void init(int n)
    {
        this->n=n;
        for(int i=; i<n; i++)
            g[i].clear();
        edges.clear();
        memset(d,,sizeof d);
        memset(cur,,sizeof cur);
    }

    void addedge(int from,int to,int cap)
    {
        edges.push_back(edge(from,to,cap,));
        edges.push_back(edge(to,from,,));
        m=edges.size();
        g[from].push_back(m-);
        g[to].push_back(m-);
    }
queue<int >q;
    bool bfs()
    {
        memset(vis,,sizeof vis);
        while(!q.empty()) q.pop();
        q.push(s);
        d[s]=;
        vis[s]=;
        while(!q.empty())
        {
            int x=q.front();
            q.pop();
            for(int i=; i<g[x].size(); i++)
            {
                edge& e=edges[g[x][i]];
                if(!vis[e.to]&&e.cap>e.flow)
                {
                    vis[e.to]=;
                    d[e.to]=d[x]+;
                    q.push(e.to);
                }
            }
        }
        return vis[t];
    }

    int dfs(int x,int a)
    {
        if(x==t||a==)return a;
        int flow=,f;
        for(int &i=cur[x]; i<g[x].size(); i++)
        {
            edge& e=edges[g[x][i]];
            if(d[x]+==d[e.to]&&(f=dfs(e.to,min(a,e.cap-e.flow)))>)
            {
                e.flow+=f;
                edges[g[x][i]^].flow-=f;
                flow+=f;
                a-=f;
                if(a==)break;
            }
        }
        return flow;
    }

    int maxflow(int s,int t)
    {
        this->s=s;
        this->t=t;
        int flow=;

        while(bfs())
        {
            memset(cur,,sizeof cur);
            flow+=dfs(s,inf);
        }
        return flow;
    }

    bool panhuan(int v,int f)
    {
        if(ishuan[v])return ;
        ishuan[v]=;
        for(int i=;i<g[v].size();i++)
        {
            if(g[v][i]==(f^))continue;
            int tmp=g[v][i];
            if(edges[tmp].to==t||edges[tmp].to==s)continue;
            if(edges[tmp].cap-edges[tmp].flow>)
            {
                if(panhuan(edges[tmp].to,tmp))return ;
            }
        }
        ishuan[v]=;
        return ;
    }

    bool haofang(int x)
    {
        memset(ishuan,,sizeof ishuan);
        for(int i=; i<=x; i++)
        {
            if(panhuan(i,-))return ;
        }
        return ;
    }

    void getans(int x,int y)
    {
        for(int i=;i<edges.size();i++)
        {
            if(edges[i].cap&&edges[i].from>&&edges[i].from<=x)
            {
                jie[edges[i].from][edges[i].to-x]=edges[i].flow;
            }
        }
    }
};

int hang[];
int lie[];

dinic solve;

int main()
{
    int n,m,k;
    while(scanf("%d%d%d",&n,&m,&k)!=EOF)
    {
        int sum_hang=,sum_lie=;
        for(int i=; i<=n; i++)
        {
            scanf("%d",&hang[i]);
            sum_hang+=hang[i];
        }
        for(int i=; i<=m; i++)
        {
            scanf("%d",&lie[i]);
            sum_lie+=lie[i];
        }
        if(sum_hang!=sum_lie)
        {
            puts("Impossible");
            continue;
        }
        solve.init(n+m+);
        solve.s=;
        solve.t=n+m+;
        for(int i=;i<=n;i++)
        {
            solve.addedge(solve.s,i,hang[i]);
            for(int j=;j<=m;j++)
                solve.addedge(i,j+n,k);
        }
        for(int i=;i<=m;i++)
            solve.addedge(i+n,solve.t,lie[i]);
        int ans=solve.maxflow(solve.s,solve.t);
        if(ans!=sum_hang)
            puts("Impossible");
        else
        {
            if(solve.haofang(n))
                puts("Not Unique");
            else
            {
                puts("Unique");
                solve.getans(n,m);
                for(int i=;i<=n;i++)
                {
                    for(int j=;j<m;j++)
                        printf("%d ",solve.jie[i][j]);
                    printf("%d\n",solve.jie[i][m]);
                }
            }
        }
    }
    return ;
}