传送门
最小点覆盖板子题。
直接把行列都看作一排点,有障碍就连边,然后跑最小点覆盖就行了。
代码:
#include<queue>
#include<cstring>
#include<iostream>
#include<cstdio>
#define N 10005
using namespace std;
inline int read(){
int ans=0;
char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))ans=(ans<<3)+(ans<<1)+(ch^48),ch=getchar();
return ans;
}
int n,k;
struct edge{int v,c,next;};
struct Dinic{
int first[N],cur[N],cnt,d[N],s,t;
edge e[N<<2];
inline void init(){s=0,t=n*2+1,memset(first,-1,sizeof(first)),cnt=-1;}
inline void addedge(int u,int v,int c){e[++cnt].v=v,e[cnt].next=first[u],e[cnt].c=c,first[u]=cnt;}
inline void add(int u,int v,int c){addedge(u,v,c),addedge(v,u,0);}
inline bool bfs(){
queue<int>q;
memset(d,-1,sizeof(d)),d[s]=0,q.push(s);
while(!q.empty()){
int x=q.front();
q.pop();
for(int i=first[x];~i;i=e[i].next){
int v=e[i].v;
if(~d[v]||!e[i].c)continue;
d[v]=d[x]+1,q.push(v);
}
}
return ~d[t];
}
inline int dfs(int x,int f){
if(!f||x==t)return f;
int flow=f;
for(int&i=cur[x];~i;i=e[i].next){
int v=e[i].v;
if(!flow)break;
if(d[v]==d[x]+1&&e[i].c){
int tmp=dfs(v,min(e[i].c,flow));
if(!tmp)d[v]=-1;
e[i].c-=tmp,e[i^1].c+=tmp,flow-=tmp;
}
}
return f-flow;
}
inline int solve(){
int ret=0;
while(bfs())memcpy(cur,first,sizeof(cur)),ret+=dfs(s,0x3f3f3f3f);
return ret;
}
}dinic;
int main(){
n=read(),k=read(),dinic.init();
for(int i=1;i<=n;++i)dinic.add(dinic.s,i,1),dinic.add(i+n,dinic.t,1);
for(int i=1;i<=k;++i){
int u=read(),v=read()+n;
dinic.add(u,v,0x3f3f3f3f);
}
cout<<dinic.solve();
return 0;
}