Codeforces 546E Soldier and Traveling (最大流+输出流量分配方案)

题意

$n$个顶点$m$条边的无向图，每个点有$ai$名士兵，每名士兵只能留在原地或移动到相邻点，给出移动后每个顶点的士兵数 $bi$，问是否存在移动方案，并输出如何移动。

---

分析

很明显的最大流问题，关键是如何输出分配方案。
其实很简单，计算下关键边流量的改变就好了。

---

代码

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<vector>
#include<cctype>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<iomanip>
#include<sstream>
#include<limits>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1e5+10;
const ll MOD = 1000000007;
const double EPS = 1e-10;
const double Pi = acos(-1.0);
#define INF 0x7fffffff

struct Edge{
    int to , cap,rev;  // rev反向边
};
vector<Edge>G[maxn];
int level[maxn],iter[maxn];  // 顶点到源点的标号   当前弧
void add_edge(int from,int to,int cap) //cap容量
{
    G[from].push_back((Edge){to,cap,G[to].size()});
    G[to].push_back((Edge){from,0,G[from].size()-1 });
}
void bfs(int s) // 分层
{
    memset(level,-1,sizeof(level));
    queue<int>que;
    level[s] = 0;
    que.push(s);
    while(!que.empty())
    {
        int v = que.front();que.pop();
        for(int i = 0; i < G[v].size(); i++)
        {
            Edge &e = G[v][i];
            if (e.cap>0 && level[e.to] < 0)
            {
                level[e.to] = level[v]+1;
                que.push(e.to);
            }
        }
    }
}
int dfs(int v, int t, int f) //寻增广路
{
    if (v==t) return f;
    for(int &i = iter[v]; i < G[v].size(); i++)
    {
        Edge &e = G[v][i];
        if (e.cap > 0 && level[v] < level[e.to])
        {
            int d = dfs(e.to , t, min(f,e.cap));
            if (d > 0)
            {
                e.cap -= d;
                G[e.to][e.rev].cap += d;
                return d;
            }
        }
    }
    return 0;
}
int max_flow(int s, int t) // s到t最大流
{
    int flow = 0;
    for(;;)
    {
        bfs(s);
        if (level[t] < 0) return flow;
        memset(iter,0,sizeof(iter));
        int f;
        while((f = dfs(s,t,INF)) > 0) { flow += f;}
    }
}
int a[maxn],b[maxn];
int ans[1000][1000];
int main(){
#ifdef LOCAL
    freopen("C:\\Users\\lanjiaming\\Desktop\\acm\\in.txt","r",stdin);
    //freopen("output.txt","w",stdout);
#endif
//ios_base::sync_with_stdio(0);
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int s = 0, t = 2*n+1;
        for(int i= 0; i <= t; i++) G[i].clear();
        int n1 = 0,n2 = 0;
        for(int i = 1; i <= n; i++)
        {
            scanf("%d",&a[i]);
            n1 += a[i];
            add_edge(s,i,a[i]);
        }
        for(int i = 1; i <= n; i++)
        {
            scanf("%d",&b[i]);
            n2 += b[i];
            add_edge(i+n,t,b[i]);
        }
        for(int i = 0; i < m; i++)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            add_edge(u,v+n,inf);
            add_edge(v,u+n,inf);
        }
        for(int i = 1; i <= n; i++) add_edge(i,i+n,inf);
        if (n1 == n2 && n1 == max_flow(s,t))
        {
            puts("YES");

            for(int i = 1; i <= n; i++)
                for(int j = 0; j < G[i].size(); j++)
                  ans[i][G[i][j].to-n] = inf - G[i][j].cap;  //算流量如何分配的

            for(int i = 1; i <= n;i++)
            {
              for(int j = 1; j <= n; j++)
                if (j == 1) printf("%d",ans[i][j]);
                else printf(" %d",ans[i][j]);
              puts("");
            }
        }else puts("NO");
    }
    return 0;
}