BZOJ[1693][Usaco2007 Demo]Asteroids 网络流

题目链接http://www.lydsy.com/JudgeOnline/problem.php?id=1693

对于点$P(i,j)$，从i行向j列连一条流量为1的边，转化为最小点覆盖问题，跑二分图/最大流即可

代码如下：

#include<algorithm>
#include<cstring>
#include<ctype.h>
#include<cstdio>
#include<queue>
#define N 20200
#define INF 2147483647
using namespace std;
const int S=20101;
const int T=20102;
inline int read(){
    int x=0,f=1;char c;
    do c=getchar(),f=c=='-'?-1:f; while(!isdigit(c));
    do x=(x<<3)+(x<<1)+c-'0',c=getchar(); while(isdigit(c));
    return x*f;
}
queue<int>q;
int n,x,m,y,top=1;
int fir[N],d[N];
struct Edge{
    int to,nex,k;
    Edge(int _=0,int __=0,int ___=0):to(_),nex(__),k(___){}
}nex[N];
inline void add(int x,int y,int k){
    nex[++top]=Edge(y,fir[x],k);
    fir[x]=top;
}
inline bool bfs(){
    while(!q.empty()) q.pop();
    memset(d,-1,sizeof d);
    d[S]=1;q.push(S);
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=fir[x];i;i=nex[i].nex)
            if(nex[i].k && !~d[nex[i].to]){
                d[nex[i].to]=d[x]+1;
                q.push(nex[i].to);
            }
    }
    return ~d[T];
}
int dfs(int x,int v){
    if(x==T || !v) return v;
    int tmp=0;
    for(int i=fir[x];i;i=nex[i].nex)
        if(nex[i].k && d[nex[i].to]==d[x]+1){
            int f=dfs(nex[i].to,min(v,nex[i].k));
            v-=f;nex[i^1].k+=f;nex[i].k-=f;tmp+=f;
            if(!v) break;
        }
    if(!tmp) d[x]=-1;
    return tmp;
}
inline int dinic(){
    int tmp=0;
    while(bfs()) tmp+=dfs(S,INF);
    return tmp;
}
int main(){
    n=read();m=read();
    for(int i=1;i<=n;i++) add(S,i,1),add(i,S,0),add(i+n,T,1),add(T,i+n,0);
    for(int i=1;i<=m;i++){
        x=read();y=read();
        add(x,y+n,1);add(y+n,x,0);
    }
    printf("%d",dinic());
return 0;
}

BZOJ[1741]双倍经验