【Codeforces 1139 E. Maximize Mex】 二分图最大匹配

1139E

题意 给你n个人有n个值 和俱乐部

从每个俱乐部只能选一个人 然后定义答案为这些人里面没出现的最小非负值 

做法 每个俱乐部只能选一个人 就是二分图匹配俱乐部在右边

你从值开始跑 跑到第一个不符合的就是答案

昨晚一开始做就想到倒叙 但是不会二分图 写了个cnt代表二分图的增广路 丢人了 今天学了二分图顺着倒着做的思路去加边

从上个不行的答案开始跑 跑到不行就出来 如果都行则是最大值加一

因为坐标可能从0 开始 所以我们一开始给所有人的值都加上1 这样就可以直接跑二分图了

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 5025;
const int MAX_M = 5025*5025;
int p[MAX_N],eid,Q[MAX_N],ans[MAX_N],girl[MAX_N];
bool flag[MAX_N],use[MAX_N];
struct edge
{
    int v,next;
}e[MAX_M];
struct node
{
    int a,c;
}arr[MAX_N];
void init()
{
    eid = 0;
    memset(p,-1,sizeof(p));
}
void add(int u,int v)
{
    e[eid].v = v;
    e[eid].next = p[u];
    p[u] = eid++;
}
bool dfs(int u)
{
    for(int i = p[u];i+1;i=e[i].next)
    {
        int to = e[i].v;
        if(!use[to])
        {
            use[to] = true;
            if(!girl[to]||dfs(girl[to]))
            {
                girl[to] = u;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,q,maxx = -1;
    init();
    scanf("%d%d",&n,&m);
    for(int i = 1;i<=n;++i) scanf("%d",&arr[i].a),arr[i].a++,maxx = max(arr[i].a,maxx);
    for(int i = 1;i<=n;++i) scanf("%d",&arr[i].c);
    scanf("%d",&q);
    for(int i = 1;i<=q;++i) scanf("%d",&Q[i]),flag[Q[i]] = true;
    for(int i = 1;i<=n;++i)
    {
        if(!flag[i])
        {
            add(arr[i].a,arr[i].c);
        }
    }
    memset(ans,-1,sizeof(ans));
    for(int i = 1;i<=maxx;i++)
    {
        memset(use,false,sizeof(use));
        if(!dfs(i))
        {
            ans[q] = i-1;
            break;
        }
    }
    if(ans[q]==-1) ans[q] = maxx;
    for(int i = q;i>=2;i--)
    {
        int id = Q[i];
        add(arr[id].a,arr[id].c);
            for(int j = ans[i]+1;j<=maxx;j++)
            {
                memset(use,false,sizeof(use));
                if(!dfs(j))
                {
                    ans[i-1] = j-1;
                    break;
                }
            }
            if(ans[i-1]==-1) ans[i-1] = maxx;
    }
    for(int i = 1;i<=q;++i)
        printf("%d\n",ans[i]);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}