poj2723 Get Luffy Out（二分答案+2-sat）

二分答案，然后2-sat判定是否合法。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 2100
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,m,id[N>>1][2],bf[N],u[N],v[N],h[N],num=0;
int dfn[N],low[N],dfnum,scc,bel[N];
bool inq[N];stack<int>qq;
struct edge{
    int to,next;
}data[N<<1];
inline void add(int x,int y){
    data[++num].to=y;data[num].next=h[x];h[x]=num;
}
inline void tarjan(int x){
    low[x]=dfn[x]=++dfnum;qq.push(x);inq[x]=1;
    for(int i=h[x];i;i=data[i].next){
        int y=data[i].to;
        if(!dfn[y]) tarjan(y),low[x]=min(low[x],low[y]);
        else if(inq[y]) low[x]=min(low[x],dfn[y]);
    }if(low[x]==dfn[x]){
        ++scc;while(1){
            int y=qq.top();qq.pop();inq[y]=0;
            bel[y]=scc;if(y==x) break;
        }
    }
}
inline bool jud(int mid){
    memset(h,0,sizeof(h));num=0;memset(dfn,0,sizeof(dfn));
    memset(low,0,sizeof(low));dfnum=0;scc=0;
    for(int i=1;i<=mid;++i){
        add(bf[u[i]],v[i]);add(bf[v[i]],u[i]);
    }for(int i=0;i<n*2;++i) if(!dfn[i]) tarjan(i);
    for(int i=1;i<=n;++i) if(bel[id[i][0]]==bel[id[i][1]]) return 0;return 1;
}
int main(){
//  freopen("a.in","r",stdin);
    while(1){
        n=read();m=read();if(!n&&!m) break;
        for(int i=1;i<=n;++i) id[i][0]=read(),id[i][1]=read(),bf[id[i][0]]=id[i][1],bf[id[i][1]]=id[i][0];
        for(int i=1;i<=m;++i) u[i]=read(),v[i]=read();
        int l=1,r=m;
        while(l<=r){
            int mid=l+r>>1;
            if(jud(mid)) l=mid+1;
            else r=mid-1;
        }printf("%d\n",l-1);
    }return 0;
}