【图论补完计划】poj 2723（2-SAT）

Get Luffy Out

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 8688		Accepted: 3371

Description

Ratish is a young man who always dreams of being a hero. One day his friend Luffy was caught by Pirate Arlong. Ratish set off at once to Arlong's island. When he got there, he found the secret place where his friend was kept, but he could not go straight in. He saw a large door in front of him and two locks in the door. Beside the large door, he found a strange rock, on which there were some odd words. The sentences were encrypted. But that was easy for Ratish, an amateur cryptographer. After decrypting all the sentences, Ratish knew the following facts:

Behind the large door, there is a nesting prison, which consists of M floors. Each floor except the deepest one has a door leading to the next floor, and there are two locks in each of these doors. Ratish can pass through a door if he opens either of the two locks in it. There are 2N different types of locks in all. The same type of locks may appear in different doors, and a door may have two locks of the same type. There is only one key that can unlock one type of lock, so there are 2N keys for all the 2N types of locks. These 2N keys were divided into N pairs, and once one key in a pair is used, the other key will disappear and never show up again.

Later, Ratish found N pairs of keys under the rock and a piece of paper recording exactly what kinds of locks are in the M doors. But Ratish doesn't know which floor Luffy is held, so he has to open as many doors as possible. Can you help him to choose N keys to open the maximum number of doors?

Input

There are several test cases. Every test case starts with a line containing two positive integers N (1 <= N <= 2¹⁰) and M (1 <= M <= 2¹¹) separated by a space, the first integer represents the number of types of keys and the second integer represents the number of doors. The 2N keys are numbered 0, 1, 2, ..., 2N - 1. Each of the following N lines contains two different integers, which are the numbers of two keys in a pair. After that, each of the following M lines contains two integers, which are the numbers of two keys corresponding to the two locks in a door. You should note that the doors are given in the same order that Ratish will meet. A test case with N = M = 0 ends the input, and should not be processed.

Output

For each test case, output one line containing an integer, which is the maximum number of doors Ratish can open.

Sample Input

3 6
0 3
1 2
4 5
0 1
0 2
4 1
4 2
3 5
2 2
0 0

Sample Output

4

题意
现在有N对钥匙（一共2N把，编号从0到2N-1），每对钥匙只能选其中一把。另有M扇门，每扇门能够被两把钥匙a，b中的任意一把打开，问能开的最大门数是多少（开门为递增顺序）

思路
2-SAT,找到矛盾关系。①如果a，b出现在同一对钥匙里，只能拿a或拿b。②如果c，d能打开同一扇门，为了最大化开门数，我们假定，不用c开门或不用d开门。
蕴含式表示形式：a->!b和b->!a，!c->d和!d->c。按照这个建图，求scc，如果i和i+2*n在一个强连通分量里（即i和!i在同一个主合取范式里）则无解。
由于求的是最大值，所以二分处理。

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

using namespace std;

typedef pair<int,int> P;

const int maxn=6000;

vector<int> G[maxn];
vector<int> rG[maxn];
vector<int> vs;

int n,m;

bool used[maxn];
int cmp[maxn];

inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

void init(){
    for(int i=0;i<maxn;i++){
        G[i].clear();
        rG[i].clear();
        cmp[i]=0;
    }
}

void add_edge(int s,int t){
    G[s].push_back(t);
    rG[t].push_back(s);
}

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

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

int scc(){
    vs.clear();
    memset(used,0,sizeof(used));
    for(int i=0;i<4*n;i++){
        if(!used[i]) dfs(i);
    }
    memset(used,0,sizeof(used));
    int k=0;
    for(int i=vs.size()-1;i>=0;i--){
        if(!used[vs[i]]) rdfs(vs[i],++k);
    }
    return k;
}

P key[maxn];
P door[maxn];

bool solve(int num){
    init();
    for(int i=0;i<n;i++){
        add_edge(key[i].first,key[i].second+2*n);
        add_edge(key[i].second,key[i].first+2*n);
    }
    for(int i=0;i<num;i++){
        add_edge(door[i].first+2*n,door[i].second);
        add_edge(door[i].second+2*n,door[i].first);
    }
    int k=scc();
    for(int i=0;i<2*n;i++){
        if(cmp[i]==cmp[i+2*n]){
            return false;
        }
    }
    return true;
}

int main(){
    while(true){
        n=read();m=read();
        if(n==0&&m==0) break;
        for(int i=0;i<n;i++){
            key[i].first=read();
            key[i].second=read();
        }
        for(int i=0;i<m;i++){
            door[i].first=read();
            door[i].second=read();
        }
        int l=0,r=m;
        int ans=0;
        while(l<=r){
            int mid=(l+r)/2;
            if(solve(mid)){
                ans=max(ans,mid);
                l=mid+1;
            }
            else r=mid-1;
        }
        printf("%d
",ans);
    }
    return 0;
}