羊吃草

题目链接

二分图匹配
每次查询都进行一次二分图匹配 给每个点尽量分一只羊 看有多少个点匹配羊

#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
struct node{
    int to, next;
}edge[N];
int cnt = 0;
int head[N];
void add(int from, int to){
    edge[cnt].to = to;
    edge[cnt].next = head[from];
    head[from] = cnt ++;
}
int a[N], b[N],vis[N],match[N];
bool dfs(int x){
    for(int i = head[x],y; ~i; i = edge[i].next){
        if(!vis[y = edge[i].to]){
            vis[y] = 1;
            if(!match[y] ||dfs(match[y])){
                match[y] = x;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    memset(head, -1, sizeof head);
    int n,q;
    scanf("%d%d",&n,&q);
    for(int i = 1 ; i <= n ;i ++){
        scanf("%d",&a[i]);
    }
    for(int i = 1; i <= n; i++){
        scanf("%d",&b[i]);
        for(int j = a[i]; j <= b[i]; j ++){
            add(j , i);
        }
    }

    while(q --){
        int l, r;
        
        for(int i = 0; i <= n; i ++) match[i] = 0;
        scanf("%d%d",&l,&r);
        int ans = 0 ;
        for(int i = l; i <= r;i ++){
            for(int i = 0; i <= n; i ++) vis[i] = 0;
            if(dfs(i)) ans ++;
        }
        printf("%d\n",ans);
    }
}