Codeforces Round #304 (Div. 2) E - Soldier and Traveling 最大流 isap

题意：n个点m条边的一张图，每个点有初始状态a个兵，然后每个点能向相邻的点运送兵，问能不能有一种运法能使每个点到达最终状态b。

其实没想清楚如何建图。。但是似乎把每个点拆成两个点，分别连超源超汇，然后跑一发最大流，判断满流，跑完后边的流量就是最终答案。。

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define asd puts("sdfsdfsdfsdfsdfsdf");
typedef long long ll;
typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 440;
const int st = 0, ed = N - 10, nv = ed + 1;

struct node{
    int nxt, v, w;
}e[N<<4];

int head[N];
int cur[N];
int dep[N];
int gap[N];
int s[N], top;
int n, m, cnt;
queue <int> q;
void init()
{
    cnt = 0;
    memset( head, -1, sizeof( head ) );
}

void add( int u, int v, int w )
{
    e[cnt].w = w;
    e[cnt].v = v;
    e[cnt].nxt = head[u];
    head[u] = cnt++;

    e[cnt].w = 0;
    e[cnt].v = u;
    e[cnt].nxt = head[v];
    head[v] = cnt++;
}

int a[N], b[N];
int c[N][N];

void rev_bfs()
{
    while( !q.empty() ) q.pop();
    memset( dep, -1, sizeof( dep ) );
    memset( gap, 0, sizeof( gap ) );
    dep[ed] = 0;
    gap[0] = 1;
    q.push( ed );
    while( !q.empty() ) {
        int u = q.front();
        q.pop();
        for( int i = head[u]; ~i; i = e[i].nxt ) {
            int v = e[i].v;
            if( ~dep[v] )
                continue;
            dep[v] = dep[u] + 1;
            gap[dep[v]]++;
            q.push( v );
        }
    }
}

int isap()
{
    memcpy( cur, head, sizeof cur );
    rev_bfs();
    int flow = 0, u = st, i;
    top = 0;
    while( dep[st] < nv ) {
        if( u == ed ) {
            int minn = inf, tmp;
            for( i = 0; i < top; ++i ) {
                if( minn > e[s[i]].w ) {
                    minn = e[s[i]].w;
                    tmp = i;
                }
            }
            for( i = 0; i < top; ++i ) {
                e[s[i]].w -= minn;
                e[s[i]^1].w += minn;
            }
            flow += minn;
            top = tmp;
            u = e[s[top]^1].v;
        }
        for( i = cur[u]; ~i; i = e[i].nxt ) {
            int v = e[i].v;
            if( e[i].w > 0 && dep[u] == dep[v] + 1 ) {
                cur[u] = i;
                break;
            }
        }
        if( ~i ) {
            s[top++] = i;
            u = e[i].v;
        }
        else {
            if( 0 == (--gap[dep[u]]) )
                break;
            int minn = nv;
            for( i = head[u]; ~i; i = e[i].nxt ) {
                int v = e[i].v;
                if( e[i].w > 0 && minn > dep[v] ) {
                    minn = dep[v];
                    cur[u] = i;
                }
            }
            dep[u] = minn + 1;
            gap[dep[u]]++;
            if( u != st ) {
                u = e[s[--top]^1].v;
            }
        }
    }
    return flow;
}

int main()
{
    while( ~scanf("%d%d", &n, &m) ) {
        init();
        int sum = 0, sum1 = 0;
        for( int i = 1; i <= n; ++i ) {
            scanf("%d", &a[i]);
            sum += a[i];
            add( st, i, a[i] );
            add( i, i + n, inf );
        }
        for( int i = 1; i <= n; ++i ) {
            scanf("%d", &b[i]);
            sum1 += b[i];
            add( i+n, ed, b[i] );
        }
        int v, u;
        while( m-- ) {
            scanf("%d%d", &u, &v);
            add( u, v+n, inf );
            add( v, u+n, inf );
        }
        if( sum1 != sum ) {
            puts("NO");
            continue;
        }
        int flow = isap();
        if( flow == sum ) {
            puts("YES");
            memset( c, 0, sizeof( c ) );
            for( int i = 1; i <= n; ++i ) {
                for( int j = head[i]; ~j; j = e[j].nxt ) {
                    int v = e[j].v, w = e[j^1].w;
                    c[i][v-n] = e[j^1].w;
                }
            }
            for( int i = 1; i <= n; ++i ) {
                for( int j = 1; j <= n; ++j ) {
                    printf("%d ", c[i][j]);
                }
                puts("");
            }
        }
        else {
            puts("NO");
        }
    }
    return 0;
}