5251: [2018多省省队联测]劈配

简单观察即可发现是个网络流。
然后建边很好弄。
考虑第一个询问实际上就只用枚举一下当前放第几志愿能跑出流量。
第二个询问实际上就是重新建图跑流量。
发现直接不是很好求出答案，
那么发现可以在跑第i个人之前，处理一下哪些点还可以放人，然后更新答案即可
c++代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x ; i <= y; ++ i)
#define repd(i,x,y) for(register int i = x ; i >= y; -- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
    x = 0;char c;int sign = 1;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 505,M = 1e5+50,inf = 1e9+7;
int n,m,s,t,rk[N];
int b[N],S[N],d[N],ans[N];
int Head[N],Nxt[M],To[M],val[M],Tot;
int l[N],head[N],cur[N],nxt[M],to[M],f[M],tot;
vector<int> a[N][N];

inline void add(int x,int y,int flow)
{
    f[tot] = flow;
    to[tot] = y;
    nxt[tot] = head[x];
    head[x] = tot++;
}

inline void Add(int x,int y,int w)
{
    val[Tot] = w;
    To[Tot] = y;
    Nxt[Tot] = Head[x];
    Head[x] = Tot++;
}

int q[N],st,en;
inline bool bfs()
{
    memset(d,0,sizeof d);
    d[s] = 1;q[st=en=0] = s;
    while(st <= en)
    {
        int x = q[st++];cur[x] = head[x];
        for(register int i = head[x];~i;i=nxt[i])
            if(f[i] && !d[to[i]])
            {
                d[to[i]] = d[x] + 1;
                q[++en] = to[i];
            }
    }
    return d[t];
}

int dfs(int x,int w)
{
    if(!w || x == t) return w;
    int flow = 0,F;
    for(register int i = head[x];~i;i=nxt[i])
        if(d[to[i]] == d[x] + 1 && (F = dfs(to[i],min(f[i],w))))
        {
            flow += F; w -= F; 
            f[i] -= F; f[i^1] += F;
            if(!w) break;
        }
    return flow;
}

inline bool check(int x,int y)
{
    int cnt = tot;memcpy(l,head,sizeof head);
    rep(i,0,((int)a[x][y].size()) - 1)
        add(x,a[x][y][i],1),add(a[x][y][i],x,0);
    if(bfs()) {dfs(s,inf); return true; }
    tot = cnt;memcpy(head,l,sizeof l);
    return false;
}

inline void solve()
{
    memset(ans,0,sizeof ans);
    memset(Head,-1,sizeof Head); 
    memset(head,-1,sizeof head);
    memset(rk,0,sizeof rk);
    tot = Tot = 0;
    read(n); read(m);
    s = 0,t = n + m + 1;
    rep(i,1,n) add(s,i,1),add(i,s,0);
    rep(i,1,m) read(b[i]),add(n + i,t,b[i]),add(t,n + i,0);
    rep(i,1,n)
    {
        rep(j,1,m) 
        {
            int x;
            read(x);
            if(x == 0) continue;
            a[i][x].push_back(j+n);
            Add(j+n,i,x);
        }
        while(!check(i,++rk[i]) && rk[i] <= m);
    }
    rep(i,1,n) read(S[i]),S[i] = min(S[i],m);

    tot = 0;memset(head,-1,sizeof head);
    rep(i,1,m) add(n + i,t,b[i]),add(t,n + i,0);
    rep(i,1,n)
    {
        rep(j,0,((int)a[i][rk[i]].size()) - 1)
            add(i,a[i][rk[i]][j],1),add(a[i][rk[i]][j],i,0);

        rep(j,n+1,n+m)
        {
            int cnt = tot,p1 = head[j],p2 = head[s];
            add(s,j,1); add(j,s,0);
            if(bfs())
            {
                for(register int k = Head[j];~k;k=Nxt[k])
                    if(val[k] <= S[To[k]] && i <= To[k])
                        ans[To[k]] = i;
            }
            tot = cnt,head[j] = p1,head[s] = p2;
        }
        add(s,i,1),add(i,s,0);
        while(bfs()) dfs(s,inf);
    }
    rep(i,1,n) printf("%d%c",rk[i],i==n?'\n':' ');
    rep(i,1,n) printf("%d%c",i-ans[i],i==n?'\n':' ');
    rep(i,1,n) rep(j,1,m) a[i][j].clear();
}

int main()
{
//  freopen("mentor9.in","r",stdin);
//  freopen("123.out","w",stdout);
    int t,c;
    read(t); read(c);
    while(t -- )
        solve();
    return 0;
}