二分图多重匹配

Jamie’s Contact Groups POJ - 2289 题目链接

题意

给定朋友们可能属于的组的编号，让你求分成组的最多的联系人最少。

思路

二分图多重匹配模板题

#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
const int N = 1111;
const int M = 555;
const int INF = 0x3f3f3f3f;
int vis[N];
int link[N][N];
int g[N][M];
int n,m;
bool dfs(int u,int mid)
{
    for (int i = 0; i < m; i++){
        if (!g[u][i]) continue;
        if (vis[i]) continue;
        vis[i] = 1;
        if (link[i][0] < mid){
            link[i][++link[i][0]] = u;
            return true;
        }
        for (int j = 1; j <= mid; j++){
            if (dfs(link[i][j],mid)){
                link[i][j] = u;
                return true;
            }
        }
    }
    return false;
}
int solve(int mid)
{
    int ans = 0;
    for (int i = 0; i < m; i++){
        link[i][0] = 0;
    }
    for (int i = 1; i <= n; i++){
        memset(vis,0,sizeof(vis));
        if (dfs(i,mid)) ans++;
    }
    return ans;
}
int main()
{
    while(scanf("%d %d",&n,&m) == 2 && (n || m)){
        memset(g,0,sizeof(g));
        for (int i = 1; i <= n; i++){
            string s;
            cin >> s;
            while (getchar() != '\n'){
                int x;
                scanf("%d",&x);
                g[i][x] = 1;
            }
        }
        int l = 1,r = n,ans;
        while(l <= r){
            int mid = (l + r) >> 1;
            if (solve(mid) == n){
                ans = mid;
                r = mid - 1;
            }
            else l = mid + 1;
        }
        printf("%d\n",ans);
    }
    return 0;
}

Optimal Milking POJ - 2112 题目链接

题意

k个机器，每个机器最多服务m头牛。

c头牛，每个牛需要1台机器来服务。

告诉你牛与机器每个之间的直接距离。

问：让所有的牛都被服务的情况下，使走的最远的牛的距离最短，求这个距离。

思路

二分图多重匹配基础上，二分查找最短距离即可（使用floyd建图）

#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
const int N = 333;
const int M = 555;
const int INF = 0x3f3f3f3f;
int vis[N];
int link[N][N];
int g[N][M];
int n,m,k;
bool dfs(int u,int mid)
{
    for (int i = 1; i <= n; i++){
        if (g[u][i] > mid) continue;
        if (vis[i]) continue;
        vis[i] = 1;
        if (link[i][0] < k){
            link[i][++link[i][0]] = u;
            return true;
        }
        for (int j = 1; j <= k; j++){
            if (dfs(link[i][j],mid)){
                link[i][j] = u;
                return true;
            }
        }
    }
    return false;
}
int solve(int mid)
{
    int ans = 0;
    for (int i = 1; i <= n; i++){
        link[i][0] = 0;
    }
    for (int i = n + 1; i <= n + m; i++){
        memset(vis,0,sizeof(vis));
        if (dfs(i,mid)) ans++;
    }
    return ans;
}
void floyd()
{
    for (int k = 1; k <= n + m; k++){
        for (int i = 1; i <= n + m; i++){
            for (int j = 1; j <= n + m; j++){
                g[i][j] = min(g[i][j],g[i][k] + g[k][j]);
            }
        }
    }
}
int main()
{
    while(scanf("%d %d %d",&n,&m,&k) == 3){
        for (int i = 1; i <= n + m; i++){
            for (int j = 1; j <= n + m; j++){
                scanf("%d",&g[i][j]);
                if (g[i][j] == 0 && i != j) g[i][j] = INF;
            }
        }
        floyd();
        int l = 1,r = 6e4,ans;
        while(l <= r){
            int mid = (l + r) >> 1;
            if (solve(mid) == m){
                ans = mid;
                r = mid - 1;
            }
            else l = mid + 1;
        }
        printf("%d\n",ans);
    }
    return 0;
}

Steady Cow Assignment POJ - 3189 题目链接

题意

农夫约翰有n个牛，m个牛棚，每个牛都有对m个牛棚的一个排序，表示自己住在其中的舒适程度。。。你的任务就是找出一个牛棚居住的安排。。。让舒适度最小的和最大的差值最小

思路

solve的写法

#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
const int N = 1111;
const int M = 555;
const int INF = 0x3f3f3f3f;
int vis[N];
int link[M][N];
int limit[M];
int g[N][M];
int n,m,k;
bool dfs(int u,int l,int r)
{
    for (int i = l; i <= r; i++){
        int v = g[u][i];
        if (vis[v]) continue;
        vis[v] = 1;
        if (link[v][0] < limit[v]){
            link[v][++link[v][0]] = u;
            return true;
        }
        for (int j = 1; j <= limit[v]; j++){
            if (dfs(link[v][j],l,r)){
                link[v][j] = u;
                return true;
            }
        }
    }
    return false;
}
bool solve(int l,int r)
{
    for (int i = 1; i <= m; i++){
        link[i][0] = 0;
    }
    for (int i = 1; i <= n; i++){
        memset(vis,0,sizeof(vis));
        if (!dfs(i,l,r)) return false;
    }
    return true;
}
int main()
{
    while(scanf("%d %d",&n,&m) == 2){
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= m; j++){
                scanf("%d",&g[i][j]);
            }
        }
        for (int i = 1; i <= m; i++){
            scanf("%d",&limit[i]);
        }
        for (int len = 1; len <= m; len++){
            bool flag = false;
            for (int i = 1; i + len - 1 <= m; i++){
                if (solve(i,i + len - 1)){
                    printf("%d\n",len);
                    flag = true;
                    break;
                }
            }
            if (flag) break;
        }
    }
    return 0;
}

HDU 3605 题目链接

题意

n个人，m个星球，m个星球最多住limit[i]个人，问是否每个人都有星球住

思路

裸的二分图多重匹配
但是vis数组开太大就会TLE,使用IO优化可以快个300ms

#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
const int N = 1e5 + 5;
const int M = 22;
const int INF = 0x3f3f3f3f;
bool vis[M];
int link[M][N];
int limit[M];
int g[N][M];
int n,m;
int in()
{
    char ch;
    int a = 0;
    while((ch = getchar()) == ' ' || ch == '\n');
    a += ch - '0';
    while((ch = getchar()) != ' ' && ch != '\n')
    {
        a *= 10;
        a += ch - '0';
    }
    return a;
}
bool dfs(int u)
{
    for (int i = 1; i <= m; i++){
        if (!g[u][i]) continue;
        if (vis[i]) continue;
        vis[i] = 1;
        if (link[i][0] < limit[i]){
            link[i][++link[i][0]] = u;
            return true;
        }
        for (int j = 1; j <= limit[i]; j++){
            if (dfs(link[i][j])){
                link[i][j] = u;
                return true;
            }
        }
    }
    return false;
}
bool solve()
{
    for (int i = 1; i <= m; i++){
        link[i][0] = 0;
    }
    for (int i = 1; i <= n; i++){
        memset(vis,0,sizeof(vis));
        if (!dfs(i)) return false;
    }
    return true;
}
int main()
{
    while(scanf("%d %d",&n,&m) == 2){
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= m; j++){
                g[i][j] = in();
            }
        }
        for (int i = 1; i <= m; i++){
            scanf("%d",&limit[i]);
        }
        if (solve()) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}