POJ2723_Get Luffy Out_二分&&2-sat

题意

有 2 * n 把钥匙两两凑成一对，一对钥匙中，能且只能选择一把钥匙能用。有 m 扇门，每扇门上有两个锁，每个锁都能用 2 * n 把钥匙中的一把打开。且必须按照输入的顺序依次开门。问最多能开几扇门。

思路

二分+2sat

链接

http://poj.org/problem?id=2723

代码

#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>

using namespace std;

const int maxn = 1300 + 10;
const int maxv = maxn << 1;
const int maxm = 2050 + 10;

struct P{
    int x, y;
    P(){}
    P(int x, int y): x(x), y(y){}
};

int n, m, v;
int op[maxv];
vector<int> G[maxv], rG[maxv], vs;
bool vis[maxv];
int cmp[maxv];
P door[maxm];

void add(int a, int b){
    G[a].push_back(b);
    rG[b].push_back(a);
}

void dfs(int v){
    vis[v] = true;
    for(int i = 0; i < G[v].size(); ++i){
        if(!vis[G[v][i]]) dfs(G[v][i]);
    }
    vs.push_back(v);
}

void rdfs(int v, int k){
    vis[v] = true;
    cmp[v] = k;
    for(int i = 0; i < rG[v].size(); ++i){
        if(!vis[rG[v][i]]) rdfs(rG[v][i], k);
    }
}

int scc(){
    memset(vis, false, sizeof vis);                 //第一遍dfs标序号(这里用有序数组代替)
    vs.clear();
    for(int i = 0; i < v; ++i){
        if(!vis[i]) dfs(i);
    }

    int k = 0;                                      //第二遍反向dfs分连通分量
    memset(vis, false, sizeof vis);
    for(int i = vs.size()-1; i >= 0; --i){
        if(!vis[vs[i]]) rdfs(vs[i], k++);
    }

    return k;
}

bool judge(int x){
    for(int i = 0; i < v; ++i){
        G[i].clear();
        rG[i].clear();
    }

    for(int i = 0; i < x; ++i){
        add(op[door[i].x], door[i].y);
        add(op[door[i].y], door[i].x);
    }

    scc();

    for(int i = 0; i < v; ++i){
        if(cmp[i] == cmp[op[i]]) return false;
    }
    return true;
}

int solve(){
    int lb = 0, ub = m;
    while(lb <= ub){
        int mid = (lb + ub) >> 1;
        if(judge(mid)) lb = mid + 1;
        else ub = mid - 1;
    }
    return ub;
}

int main(){
    while(scanf("%d %d", &n, &m) == 2 && n && m){
        v = n << 1;
        for(int i = 0; i < n; ++i){
            int x, y;
            scanf("%d %d", &x, &y);
            op[x] = y, op[y] = x;
        }
        for(int i = 0; i < m; ++i){
            scanf("%d %d", &door[i].x, &door[i].y);
        }
        printf("%d\n", solve());
    }

    return 0;
}