HDU1816(二分+2-SAT)

Get Luffy Out *

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 978    Accepted Submission(s): 426

Problem 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 made N pairs,one key may be appear in some 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^10) and M (1 <= M <= 2^11) 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 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

Hint

题目有更改！

 

 

Source

Beijing 2005

 

二分能够到达的层数。

首先每队钥匙之间建边。

然后前deep层的锁建边。

2-SAT判定是否可行。

//2017-08-28
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>

using namespace std;

const int N = 5010;
const int M = N*N*2;
int head[N], rhead[N], tot, rtot;
struct Edge{
    int to, next;
}edge[M], redge[M];

void init(){
    tot = 0;
    rtot = 0;
    memset(head, -1, sizeof(head));
    memset(rhead, -1, sizeof(rhead));
}

void add_edge(int u, int v){
    edge[tot].to = v;
    edge[tot].next = head[u];
    head[u] = tot++;

    redge[rtot].to = u;
    redge[rtot].next = rhead[v];
    rhead[v] = rtot++;
}

vector<int> vs;//后序遍历顺序的顶点列表
bool vis[N];
int cmp[N];//所属强连通分量的拓扑序

//input: u 顶点
//output: vs 后序遍历顺序的顶点列表
void dfs(int u){
    vis[u] = true;
    for(int i = head[u]; i != -1; i = edge[i].next){
        int v = edge[i].to;
        if(!vis[v])
          dfs(v);
    }
    vs.push_back(u);
}

//input: u 顶点编号; k 拓扑序号
//output: cmp[] 强连通分量拓扑序
void rdfs(int u, int k){
    vis[u] = true;
    cmp[u] = k;
    for(int i = rhead[u]; i != -1; i = redge[i].next){
        int v = redge[i].to;
        if(!vis[v])
          rdfs(v, k);
    }
}

//Strongly Connected Component 强连通分量
//input: n 顶点个数
//output: k 强连通分量数;
int scc(int n){
    memset(vis, 0, sizeof(vis));
    vs.clear();
    for(int u = 0; u < n; u++)
      if(!vis[u])
        dfs(u);
    int k = 0;
    memset(vis, 0, sizeof(vis));
    for(int i = vs.size()-1; i >= 0; i--)
      if(!vis[vs[i]])
        rdfs(vs[i], k++);
    return k;
}

int n, m;
pair<int, int> key[N], lock[N];

//二分层数
bool check(int deep){
    init();
    for(int i = 0; i < n; i++){
        //add_edge(key[i].first, key[i].second+2*n);
        add_edge(key[i].second+2*n, key[i].first);// NOT v -> u
        //add_edge(key[i].second, key[i].first+2*n);
        add_edge(key[i].first+2*n, key[i].second);// NOT u -> v
    }
    for(int i = 0; i < deep; i++){
        add_edge(lock[i].first, lock[i].second+2*n);// u -> NOT v
        //add_edge(lock[i].second+2*n, lock[i].first);
        add_edge(lock[i].second, lock[i].first+2*n);// v -> NOT u
        //add_edge(lock[i].first+2*n, lock[i].second);
    }
    scc(4*n);
    for(int i = 0; i < 2*n; i++){
        if(cmp[i] == cmp[i+2*n])
              return false;
    }
    return true;
}

int main()
{
    std::ios::sync_with_stdio(false);
    //freopen("inputF.txt", "r", stdin);
    while(cin>>n>>m){
        if(!n && !m)break;
        for(int i = 0; i < n; i++)
              cin>>key[i].first>>key[i].second;
        for(int i = 0; i < m; i++)
              cin>>lock[i].first>>lock[i].second;
        int l = 0, r = m, mid, ans = 0;
        while(l <= r){
            mid = (l+r)/2;
            if(check(mid)){
                ans = mid;
                l = mid+1;
            }else
                  r = mid-1;
        }
        cout<<ans<<endl;
    }
    return 0;
}