【网络流24题】圆桌问题

Description

click me

Solution

从原点向每一个单位连一条流量为单位人数的边，单位和桌子间连一条流量为1的边，桌子和汇点之间连一条流量为桌子容量的边，跑最大流即可。

Code

/**************************
 * Au: Hany01
 * Date: Jan 13th, 2018
 * Prob: luogu3254
 * Email: hany01@foxmail.com
**************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define rep(i , j) for (int i = 0 , i##_end_ = j; i < i##_end_ ; ++ i)
#define For(i , j , k) for (int i = (j) , i##_end_ = (k) ; i <= i##_end_ ; ++ i)
#define Fordown(i , j , k) for (int i = (j) , i##_end_ = (k) ; i >= i##_end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define y1 wozenmezhemecaia 
#ifdef hany01
#define debug(...) fprintf(stderr , __VA_ARGS__)
#else
#define debug(...)
#endif

inline void File() {
#ifdef hany01 
    freopen("luogu3254.in" , "r" , stdin);
    freopen("luogu3254.out" , "w" , stdout);
#endif
}

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

char c_; int _ , __;
inline int read() {
    for (_ = 0 , __ = 1 , c_ = getchar() ; !isdigit(c_) ; c_ = getchar()) if (c_ == '-')  __ = -1;
    for ( ; isdigit(c_) ; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 10500, maxm = 160 * 3800;

int n, m, s, t, Sum, e, num[maxn], all, v[maxm], f[maxm], nex[maxm], beg[maxn], d[maxn], gap[maxn];

inline void add_(int uu, int vv, int ff) { v[++ e] = vv; f[e] = ff; nex[e] = beg[uu]; beg[uu] = e; }
inline void add(int uu, int vv, int ff) { add_(uu, vv, ff); add_(vv, uu, 0); }

inline void Init()
{
    n = read(); m = read(); s = 0; t = n + m + 1; Sum = t + 1; e = 1;
    For(i, 1, n) add(s, i, num[i] = read()), all += num[i];
    For(j, 1, m) add(n + j, t, read());
    For(i, 1, n) For(j, 1, m) add(i, j + n, 1);
}

int sap(int u, int flow)
{
    if (u == t) return flow;
    register int res = flow, tmp;
    for (register int i = beg[u]; i; i = nex[i])
        if (f[i] && d[v[i]] + 1 == d[u]) {
            tmp = sap(v[i], min(res, f[i]));
            f[i] -= tmp; f[i ^ 1] += tmp;
            if (!(res -= tmp)) return flow;
        }
    if (!-- gap[d[u] ++]) d[t] = Sum;
    ++ gap[d[u]];
    return flow - res;
}

inline bool Solve()
{
    int Ans = 0;
    for (gap[0] = Sum; d[t] < Sum; ) Ans += sap(s, INF);
    return Ans == all;
}

inline void Print()
{
    puts("1");
    For(i, 1, n) {
        for (register int j = beg[i]; j; j = nex[j])
            if (!f[j] && v[j] != s) printf("%d ", v[j] - n);
        putchar('\n');
    }
}

int main()
{
    File();
    Init();
    if (Solve()) Print(); else puts("0");
    return 0;
}
//等闲识得东风面，万紫千红总是春。
//    -- 朱熹《春日》