poj-2289.jamies contact groups(二分答案 + 二分多重匹配)

Jamie's Contact Groups

Time Limit: 7000MS		Memory Limit: 65536K
Total Submissions: 9227		Accepted: 3180

Description

Jamie is a very popular girl and has quite a lot of friends, so she always keeps a very long contact list in her cell phone. The contact list has become so long that it often takes a long time for her to browse through the whole list to find a friend's number. As Jamie's best friend and a programming genius, you suggest that she group the contact list and minimize the size of the largest group, so that it will be easier for her to search for a friend's number among the groups. Jamie takes your advice and gives you her entire contact list containing her friends' names, the number of groups she wishes to have and what groups every friend could belong to. Your task is to write a program that takes the list and organizes it into groups such that each friend appears in only one of those groups and the size of the largest group is minimized.

Input

There will be at most 20 test cases. Ease case starts with a line containing two integers N and M. where N is the length of the contact list and M is the number of groups. N lines then follow. Each line contains a friend's name and the groups the friend could belong to. You can assume N is no more than 1000 and M is no more than 500. The names will contain alphabet letters only and will be no longer than 15 characters. No two friends have the same name. The group label is an integer between 0 and M - 1. After the last test case, there is a single line `0 0' that terminates the input.

Output

For each test case, output a line containing a single integer, the size of the largest contact group.

Sample Input

3 2
John 0 1
Rose 1
Mary 1
5 4
ACM 1 2 3
ICPC 0 1
Asian 0 2 3
Regional 1 2
ShangHai 0 2
0 0

Sample Output

2
2

Source

Shanghai 2004

 

这题做了有好一会,他是在求匹配所有人之后匹配分组中最大值的最小值,虽然很明显是个二分,但是......我老感觉改一下匹配的代码就过了...而且最致命的是我自己试的答案都过了嘤嘤嘤,我的第一种思路:由于题目要求使得组的上界最小,那么我们就可以通过判断条件来约束,如何约束呢,如果我们发现一个组还没有匹配人,那直接匹配,因为1一定是最小值,如果不是第一次匹配,那就让匹配他的人再去匹配其他人,匹配规则依然是这样的,但如果有一个节点不满足上述情况,意思就是这个结点所连的所有组都已经被别人匹配过了,那么就直接选第一个与其进行匹配就可以了,但是这里出问题了,因为我们不能确定第一个匹配的人就是匹配之后的最小值,因为这个值肯定要加到最小值上才不会影响答案.so下面二分答案.

 

二分答案:

　　二分答案,每次用匹配check,如果改上界可以使得完备匹配,那么就改变r,否则改变l,然后ok.输出mid.

 /*************************************************************************
     > File Name: poj-2289.jamies_contact_groups.cpp
     > Author: CruelKing
     > Mail: [e-mail]
     > Created Time: 2019年09月03日 星期二 21时09分58秒
  ************************************************************************/
 /*
 #include <iostream>
 #include <sstream>
 #include <string>
 #include <cstring>
 using namespace std;

 const int maxn = 1000 + 5, maxm = 500 + 5, inf = 0x3f3f3f3f;

 int n, m;
 string str;
 char name[20];
 int linker[maxm][maxn];
 bool used[maxm], g[maxn][maxm];

 bool dfs(int u) {
     for(int v = 0; v < m; v ++) {
         if(g[u][v] && !used[v]) {
             used[v] = true;
             if(linker[v][0] == 0) {
                 linker[v][++ linker[v][0]] = u;
                 return true;
             }
             for(int i = 1; i <= linker[v][0]; i ++) {
                 if(dfs(linker[v][i])) {
                     linker[v][i] = u;
                     return true;
                 }
             }
             linker[v][++ linker[v][0]] = u;
             return true;
         }
     }
     return false;
 }

 int main() {
     while(cin >> n >> m && (n || m)) {
         memset(g, false, sizeof g);
         for(int i = 0; i < n; i ++) {
             cin >> name;
             getline(cin, str);
             stringstream ss;
             ss << str;
             int x;
             while(ss >> x)
                 g[i][x] = true;
         }
         int res = 0;
         for(int i = 0; i < m; i ++) linker[i][0] = 0;
         for(int i = 0; i < n; i ++) {
             memset(used, false, sizeof used);
             if(dfs(i)) res ++;
         }
         int M = 0;
         for(int i = 0; i < m; i ++) {
             if(M < linker[i][0]) M = linker[i][0];
         }
         cout << M << endl;
     }
     return 0;
 }
 */
 #include <iostream>
 #include <sstream>
 #include <string>
 #include <cstring>
 #define mid ((l + r) >> 1)
 using namespace std;

 const int maxn =  + , maxm =  + , inf = 0x3f3f3f3f;

 int n, m, l, r;
 string str;
 char name[];
 int linker[maxm][maxn];
 bool used[maxm], g[maxn][maxm];

 bool dfs(int u) {
     for(int v = ; v < m; v ++) {
         if(g[u][v] && !used[v]) {
             used[v] = true;
             if(linker[v][] < mid) {
                 linker[v][++ linker[v][]] = u;
                 return true;
             }
             for(int i = ; i <= mid; i ++) {
                 if(dfs(linker[v][i])) {
                     linker[v][i] = u;
                     return true;
                 }
             }
         }
     }
     return false;
 }

 int main() {
     while(cin >> n >> m && (n || m)) {
         memset(g, false, sizeof g);
         for(int i = ; i < n; i ++) {
             cin >> name;
             getline(cin, str);
             stringstream ss;
             ss << str;
             int x;
             while(ss >> x)
                 g[i][x] = true;
         }
         /*
         int res = 0;
         l = 0, r = maxn << 1;
         for(int i = 0; i < m; i ++) linker[i][0] = 0;
         for(int i = 0; i < n; i ++) {
             memset(used, false, sizeof used);
             if(dfs(i)) res ++;
         }
         cout << res << endl;
         */
         l= , r = n;
         int res;
         while(l <= r) {
             res = ;
             for(int i = ; i < m; i ++) linker[i][] = ;
             for(int i = ; i < n; i ++) {
                 memset(used, false, sizeof used);
                 if(dfs(i)) res ++;
             }
             if(n == res) r = mid - ;
             else l = mid + ;
         }
         cout << mid +  << endl;
     }
     return ;
 }