zoukankan      html  css  js  c++  java
  • HDU 3277 Marriage Match III

    Marriage Match III

    Time Limit: 4000ms
    Memory Limit: 32768KB
    This problem will be judged on HDU. Original ID: 3277
    64-bit integer IO format: %I64d      Java class name: Main
     
    Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the ever game of play-house . What a happy time as so many friends play 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. As 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. On the other hand, in order to play more times of marriage match, every girl can accept any K boys. If a girl chooses a boy, the boy must accept her unconditionally whether they had quarreled before or not. 

    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 an integer T, means the number of test cases. 
    Each test case starts with three integer n, m, K and f in a line (3<=n<=250, 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 1 2
    1 1
    2 3
    3 2
    4 2
    4 4
    1 4
    2 3

    Sample Output

    3

    Source

     
    解题:最大流。。。
     
      1 #include <bits/stdc++.h>
      2 using namespace std;
      3 const int maxn = 260;
      4 struct arc{
      5     int to,flow,next;
      6     arc(int x = 0,int y = 0,int z = 0){
      7         to = x;
      8         flow = y;
      9         next = z;
     10     }
     11 }e[1000010];
     12 int head[maxn*maxn],d[maxn*maxn],cur[maxn*maxn];
     13 int tot,n,m,k,S,T,uf[maxn];
     14 void add(int u,int v,int flow){
     15     e[tot] = arc(v,flow,head[u]);
     16     head[u] = tot++;
     17     e[tot] = arc(u,0,head[v]);
     18     head[v] = tot++;
     19 }
     20 int Find(int x){
     21     if(x != uf[x]) uf[x] = Find(uf[x]);
     22     return uf[x];
     23 }
     24 bool bfs(){
     25     queue<int>q;
     26     q.push(T);
     27     memset(d,-1,sizeof d);
     28     d[T] = 1;
     29     while(!q.empty()){
     30         int u = q.front();
     31         q.pop();
     32         for(int i = head[u]; ~i; i = e[i].next){
     33             if(e[i^1].flow > 0 && d[e[i].to] == -1){
     34                 d[e[i].to] = d[u] + 1;
     35                 q.push(e[i].to);
     36             }
     37         }
     38     }
     39     return d[S] > -1;
     40 }
     41 int dfs(int u,int low){
     42     if(u == T) return low;
     43     int tmp = 0,a;
     44     for(int &i = cur[u]; ~i; i = e[i].next){
     45         if(e[i].flow > 0 && d[e[i].to]+1== d[u]&&(a=dfs(e[i].to,min(e[i].flow,low)))){
     46             e[i].flow -= a;
     47             low -= a;
     48             e[i^1].flow += a;
     49             tmp += a;
     50             if(!low) break;
     51         }
     52     }
     53     if(!tmp) d[u] = -1;
     54     return tmp;
     55 }
     56 int dinic(){
     57     int ret = 0;
     58     while(bfs()){
     59         memcpy(cur,head,sizeof head);
     60         ret += dfs(S,INT_MAX);
     61     }
     62     return ret;
     63 }
     64 bool con[maxn][maxn];
     65 int g[maxn*maxn],b[maxn*maxn];
     66 void build(int mid){
     67     memset(head,-1,sizeof head);
     68     tot = 0;
     69     for(int i = 1; i <= n; ++i){
     70         add(i,i+n,k);
     71         add(S,i,mid);
     72         add(i+2*n,T,mid);
     73     }
     74     for(int i = 1; i <= n; ++i)
     75         for(int j = 1; j <= n; ++j)
     76             if(con[Find(i)][j]) add(i,j+2*n,1);
     77             else add(i+n,j+2*n,1);
     78 }
     79 int main(){
     80     int kase,f,u,v;
     81     scanf("%d",&kase);
     82     while(kase--){
     83         scanf("%d%d%d%d",&n,&m,&k,&f);
     84         S = 0;
     85         T = 3*n + 1;
     86         for(int i = 0; i < maxn; ++i) uf[i] = i;
     87         for(int i = 0; i < m; ++i)
     88             scanf("%d%d",g+i,b+i);
     89         for(int i = 0; i < f; ++i){
     90             scanf("%d%d",&u,&v);
     91             u = Find(u);
     92             v = Find(v);
     93             if(u != v) uf[u] = v;
     94         }
     95         memset(con,false,sizeof con);
     96         for(int i = 0; i < m; ++i)
     97             con[Find(g[i])][b[i]] = true;
     98         int low = 0,high = n,ret = 0;
     99         while(low <= high){
    100             int mid = (low + high)>>1;
    101             build(mid);
    102             if(dinic() == n*mid){
    103                 ret = mid;
    104                 low = mid+1;
    105             }else high = mid - 1;
    106         }
    107         printf("%d
    ",ret);
    108     }
    109     return 0;
    110 }
    View Code
  • 相关阅读:
    分享一个自己写的vue多语言插件smart-vue-i18n
    利用vw+rem实现移动web适配布局
    你说前端不了解业务?
    小程序开发总结一:mpvue框架及与小程序原生的混搭开发
    小码农的职场人生一:由张小平离职引发的一些吐槽
    javascript本地缓存方案-- 存储对象和设置过期时间
    手淘移动适配方案flexible.js兼容bug处理
    微信小程序入坑之自定义组件
    vuejs开发组件分享之H5图片上传、压缩及拍照旋转的问题处理
    非域环境下使用证书部署数据库(SqlServer2008R2)镜像
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4636115.html
Copyright © 2011-2022 走看看