HDU 3081 最大流+二分

Marriage Match II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4021    Accepted Submission(s): 1309

Problem Description

Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing house we used to play when we are kids. What a happy time as so many friends playing together. And it is normal that a fight or a quarrel breaks out, but we will still play together after that, because we are kids. 
Now, there are 2n kids, n boys numbered from 1 to n, and n girls numbered from 1 to n. you know, ladies first. So, every girl can choose a boy first, with whom she has not quarreled, to make up a family. Besides, the girl X can also choose boy Z to be her boyfriend when her friend, girl Y has not quarreled with him. Furthermore, the friendship is mutual, which means a and c are friends provided that a and b are friends and b and c are friend. 
Once every girl finds their boyfriends they will start a new round of this game—marriage match. At the end of each round, every girl will start to find a new boyfriend, who she has not chosen before. So the game goes on and on.
Now, here is the question for you, how many rounds can these 2n kids totally play this game?

 

Input

There are several test cases. First is a integer T, means the number of test cases. 
Each test case starts with three integer n, m and f in a line (3<=n<=100,0<m<n*n,0<=f<n). n means there are 2*n children, n girls(number from 1 to n) and n boys(number from 1 to n).
Then m lines follow. Each line contains two numbers a and b, means girl a and boy b had never quarreled with each other. 
Then f lines follow. Each line contains two numbers c and d, means girl c and girl d are good friends.

 

Output

For each case, output a number in one line. The maximal number of Marriage Match the children can play.

 

Sample Input

1

4 5 2

1 1

2 3

3 2

4 2

4 4 

1 4

2 3

 

Sample Output

2

 

Author

starvae

 

Source

HDU 2nd “Vegetable-Birds Cup” Programming Open Contest

 题意：

有n个女生n个男生女生可以和她喜欢的男生配对也可以和她的朋友喜欢的男生配对，当所有的人都配对了时游戏结束，要求每一轮游戏中互相已经配对的两个人以后就不能再配对了问可以进行多少轮游戏。

输入t组数据

输入n，m，f，对人，m个喜欢关系，f个朋友关系

输入m行a b 表示女生a喜欢男生b

输入f行a b 表示女生a和女生b是朋友

代码：

//并查集处理配对关系，然后二分轮数，源点连向女生容量为轮数(每人玩这些次)，女生连向可以配对的男生，
//容量为1(只能配对一次)，男生连向汇点容量也是轮数。看最大流是否等于n*轮数。
//今下午脑子坏掉了，二分写挫了wa到死。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int maxn=;
const int inf=0x7fffffff;
int mp[maxn][maxn],fat[maxn];
int find(int x){
    return fat[x]==x?x:fat[x]=find(fat[x]);
}
void connect(int x,int y){
    int xx=find(x),yy=find(y);
    if(xx!=yy) fat[yy]=xx;
}
struct Edge{
    int from,to,cap,flow;
    Edge(int u,int v,int c,int f):from(u),to(v),cap(c),flow(f){}
};
struct Dinic{
    int n,m,s,t;
    vector<Edge>edges;
    vector<int>g[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];
    void init(int n){
        this->n=n;
        for(int i=;i<n;i++) g[i].clear();
        edges.clear();
    }
    void Addedge(int from,int to,int cap){
        edges.push_back(Edge(from,to,cap,));
        edges.push_back(Edge(to,from,,));//反向弧
        m=edges.size();
        g[from].push_back(m-);
        g[to].push_back(m-);
    }
    bool Bfs(){
        memset(vis,,sizeof(vis));
        queue<int>q;
        q.push(s);
        d[s]=;
        vis[s]=;
        while(!q.empty()){
            int x=q.front();q.pop();
            for(int i=;i<(int)g[x].size();i++){
                Edge &e=edges[g[x][i]];
                if(!vis[e.to]&&e.cap>e.flow){
                    vis[e.to]=;
                    d[e.to]=d[x]+;
                    q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int Dfs(int x,int a){
        if(x==t||a==) return a;
        int flow=,f;
        for(int&i=cur[x];i<(int)g[x].size();i++){
            Edge &e=edges[g[x][i]];
            if(d[x]+==d[e.to]&&(f=Dfs(e.to,min(a,e.cap-e.flow)))>){
                e.flow+=f;
                edges[g[x][i]^].flow-=f;
                flow+=f;
                a-=f;
                if(a==) break;
            }
        }
        return flow;
    }
    int Maxflow(int s,int t){
        this->s=s;this->t=t;
        int flow=;
        while(Bfs()){
            memset(cur,,sizeof(cur));
            flow+=Dfs(s,inf);
        }
        return flow;
    }
}dc;
bool solve(int n,int mid){
    dc.init(*n+);
    for(int i=;i<=n;i++){
        dc.Addedge(,i,mid);
        for(int j=n+;j<=*n;j++)if(mp[i][j])
            dc.Addedge(i,j,);
        dc.Addedge(i+n,*n+,mid);
    }
    return n*mid==dc.Maxflow(,*n+);
}
int main()
{
    int t,n,m,f;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d%d",&n,&m,&f);
        int a,b;
        memset(mp,,sizeof(mp));
        for(int i=;i<=*n;i++) fat[i]=i;
        for(int i=;i<=m;i++){
            scanf("%d%d",&a,&b);
            mp[a][b+n]=;
        }
        for(int i=;i<=f;i++){
            scanf("%d%d",&a,&b);
            connect(a,b);
        }
        for(int i=;i<=n;i++){
            for(int j=i+;j<=n;j++){
                if(find(i)==find(j))
                    for(int k=n+;k<=*n;k++)
                        mp[i][k]=mp[j][k]=(mp[i][k]||mp[j][k]);
            }
        }
        int l=,r=n,mid,ans=;
        while(l<=r){
            mid=(l+r)/;
            if(solve(n,mid)){
                ans=mid;
                l=mid+;
            }
            else r=mid-;
        }
        printf("%d\n",ans);
    }
    return ;
}