HDU - 3081 Marriage Match II(二分+最大流)

题目大意：有N个女的和N个男的，他们在玩过家家的游戏，现在他们要进行匹配，匹配的规则如下
1.男女之间要匹配的话，必须要没吵过架
2.女的可以和她的朋友匹配过的人匹配
3.如果匹配过的话，就不能再匹配了
一次完美匹配算一轮游戏，问最多可以玩多少轮的游戏

解题思路：二分匹配次数，然后跑最大流
建图如下，女的和源点相连，容量为枚举的次数
男的和汇点相连，容量为枚举的次数
能匹配的话，男女就连线，容量为1
接着只要判断是否满流就可以了

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int MAXNODE = 210;
const int MAXEDGE = 100010;
typedef int Type;
const Type INF = 0x3f3f3f3f;

struct Edge{
    int u, v, next;
    Type cap, flow;
    Edge() {}
    Edge(int u, int v, Type cap, Type flow, int next) : u(u), v(v), cap(cap), flow(flow), next(next){}
};

struct Dinic{
    int n, m, s, t;
    Edge edges[MAXEDGE];
    int head[MAXNODE];
    bool vis[MAXNODE];
    Type d[MAXNODE];
    vector<int> cut;

    void init(int n) {
        this->n = n;
        memset(head, -1, sizeof(head));
        m = 0;
    }

    void AddEdge(int u, int v, Type cap) {
        edges[m] = Edge(u, v, cap, 0, head[u]);
        head[u] = m++;
        edges[m] = Edge(v, u, 0, 0, head[v]);
        head[v] = m++;
    }

    bool BFS() {
        memset(vis, 0, sizeof(vis));
        queue<int> Q;
        Q.push(s);
        d[s] = 0;
        vis[s] = 1;

        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            for (int i = head[u]; ~i; i = edges[i].next) {
                Edge &e = edges[i];
                if (!vis[e.v] && e.cap > e.flow) {
                    vis[e.v] = true;
                    d[e.v] = d[u] + 1;
                    Q.push(e.v);
                }
            }
        }
        return vis[t];
    }

    Type DFS(int u, Type a) {
        if (u == t || a == 0) return a;

        Type flow = 0, f;
        for (int i = head[u]; ~i; i = edges[i].next) {
            Edge &e = edges[i];
            if (d[u] + 1 == d[e.v] && (f = DFS(e.v, min(a, e.cap - e.flow))) > 0) {
                e.flow += f;
                edges[i ^ 1].flow -= f;
                flow += f;
                a -= f;
                if (a == 0) break;
            }
        }
        return flow;
    }

    Type Maxflow(int s, int t) {
        this->s = s; this->t = t;
        Type flow = 0;
        while (BFS()) flow += DFS(s, INF);
        return flow;
    }

    void Mincut() {
        cut.clear();
        for (int i = 0; i < m; i += 2) {
            if (vis[edges[i].u] && !vis[edges[i].v])
                cut.push_back(i);
        }
    }
}dinic;

#define maxn 110
int p[maxn];
int n, m, f;
bool g[maxn][maxn];

int find(int x) {
    return x == p[x] ? x : p[x] = find(p[x]);
}

void init() {
    scanf("%d%d%d", &n, &m, &f);
    memset(g, 0, sizeof(g));
    for (int i = 1; i <= n; i++)
        p[i] = i;

    int u, v;
    for (int i = 1; i <= m; i++) {
        scanf("%d%d", &u, &v);
        g[u][v] = true;
    }

    for (int i = 1; i <= f; i++) {
        scanf("%d%d", &u, &v);
        p[find(u)] = find(v);
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i != j && find(j) == find(i)) {
                for (int k = 1; k <= n; k++)
                    if (g[j][k])
                        g[i][k] = true;
            }
        }
    }
}

void build(int mid) {
    int source = 0, sink = 2 * n + 1;
    dinic.init(sink + 1);

    for (int i = 1; i <= n; i++) {
        dinic.AddEdge(source, i, mid);
        dinic.AddEdge(i + n, sink, mid);
        for (int j = 1; j <= n; j++)
            if (g[i][j])  dinic.AddEdge(i, j + n, 1);
    }

}

void solve() {
    int l = 0, r = n + 1, mid;
    while (l < r) {
        mid = (l + r) / 2;
        build(mid);
        if ( dinic.Maxflow(0, 2 * n + 1) == n * mid) l = mid + 1;
        else r = mid;
    }
    printf("%d\n", l - 1);
}

int main() {
    int test;
    scanf("%d", &test);
    while (test--) {
        init();
        solve();
    }
    return 0;
}