【练习】UVALive - 3268 Jamie's Contact Groups（网络流最大流+二分）

题意

给出$n$个人和$m$个分组，每个人可以属于很多组，现在要求给出一组分组方案，使得分组后的结果中最大组尽量小，输出最后最大组中的人数。

题解

写题的时候考虑到了网络流，但是没有想到二分，就认为网络流写不了。
考虑S和每一个人连边，容量为1，每个人再和每个组连边，容量为1，最后组合T连边，容量为x，每次二分这个容量，如果最大流和人数相等，说明当前最大的人数一定小于等于x，继续二分，直到不满足二分条件。
注意每次要重新建图，直接修改图边和反向边的容量和流量也可以，不过比较麻烦了。
还有一个注意的就是二分的上限，为最多的组，一开始我写小了，后来直接指定了一个很大的值。

代码

#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
const int nmax = 1e6+7;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const ull p = 67;
const ull MOD = 1610612741;
int N,M;
bool isfirst;
vector<pair<int,int> > front,mmid;
struct Dinic {
    int head[nmax], cur[nmax], d[nmax];
    bool vis[nmax];
    int tot, n, m, s, t;
    struct edge {
        int nxt, to, w, cap, flow;
    } e[nmax<<1];
    void init(int n) {
        this->n = n;
        memset(head, -1, sizeof head);
        memset(e,0,sizeof e);
        this->tot = 0;
    }
    int add_edge(int u, int v, int c) {
        int temp = tot;
        e[tot].to = v, e[tot].cap = c, e[tot].flow = 0;
        e[tot].nxt = head[u];
        head[u] = tot++;
        e[tot].to = u, e[tot].cap = c, e[tot].flow = c;
        e[tot].nxt = head[v];
        head[v] = tot++;
        return temp;
    }
    bool BFS() {
        memset(vis, 0, sizeof(vis));
        queue<int>Q;
        vis[s] = 1; d[s] = 0;
        Q.push(s);
        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            for (int i = head[u]; i != -1; i = e[i].nxt) {
                int v = e[i].to;
                if (!vis[v] && e[i].cap > e[i].flow) {
                    vis[v] = 1;
                    d[v] = d[u] + 1;
                    Q.push(v);
                }
            }
        }
        return vis[t];
    }
    int DFS(int x, int a) {
        if (x == t || a == 0) return a;
        int Flow = 0, f;
        for (int& i = cur[x]; i != -1; i = e[i].nxt) {
            int v = e[i].to;
            if (d[v] == d[x] + 1 && (f = DFS(v, min(a, e[i].cap - e[i].flow))) > 0) {
                Flow += f;
                e[i].flow += f;
                e[i ^ 1].flow -= f;
                a -= f;
                if (a == 0) break;
            }
        }
        return Flow;
    }
    int Maxflow(int s, int t) {
        this->s = s, this->t = t;
        int Flow = 0;
        while (BFS()) {
            for (int i = 0; i <= n; i++) cur[i] = head[i];
            Flow += DFS(s,INF);
        }
        return Flow;
    }
} dinic;
void build(int mid){
    int T = N + M + 1;
    dinic.init(T+1);
    for(int i = 0;i<N;++i) dinic.add_edge(0,i+1,1);
    for(int i = 0;i<mmid.size();++i) dinic.add_edge(mmid[i].first,mmid[i].second,1);
    for(int i = N+1;i<=N+M;++i) dinic.add_edge(i,T,mid);
}
bool check(){return dinic.Maxflow(0,N+M+1) == N;}
void init(){
    front.clear();
    mmid.clear();
}
int main(){
    while(scanf("%d %d",&N,&M)!=EOF){
        if(N == 0 && M == 0) break;
        init();
        int now = 0,pos = 0;
        string temp; char num[10],ch;
        while(1){
            cin>>temp;
            front.push_back(make_pair(0,++now));
//            printf("build %d %d\n",0,now);
            getchar();
            while((ch = getchar())){
                if(ch == ' ') {
                    int mnum = atoi(num)+1; pos = 0;
                    for(int i = 0;i<10;++i) num[i] = 0;
                    mmid.push_back(make_pair(now,N+mnum));
//                    printf("build %d %d\n",now,N+mnum);
                }else if(ch == '\n'){
                    int mnum = atoi(num)+1; pos = 0;
                    for(int i = 0;i<10;++i) num[i] = 0;
                    mmid.push_back(make_pair(now,N+mnum));
//                    printf("build %d %d\n",now,N+mnum);
                    break;
                }else num[pos++] = ch;
            }
            if(now == N) break;
        }
        int l = 0, r = 50000, ans = -1;
        while(l<=r){
            int mid = (l+r)>>1;
            build(mid);
            if(check()){
                ans = mid;
                r = mid - 1;
            }else l = mid + 1;
        }
        printf("%d\n",ans);
    }
    return 0;
}