poj 2584 T-Shirt Gumbo 最大匹配

题目

题目链接：http://poj.org/problem?id=2584

题目来源：http://www.cnblogs.com/vongang/archive/2012/02/21/2361882.html

题解

人和T恤（相同型号的拆开）建二分图，可以穿的就连上边，跑最大匹配，$|M|=n$则可以。

也可以直接人和型号建流量图，直接跑最大流，$s$到所有人容量为$1$，人到型号合法的就连容量为$1$的边，然后型号到$t$有一条容量为型号数量限制的边。直接跑最大流。

数据量比较小，怎么搞都可以。

代码

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <set>
#include <map>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
// head
const int N = 20;
const int TSIZE = 5;
const int M = N * TSIZE;
const int E = N * M;

struct Gragh {
    struct Edge {
        int to, nxt;
        Edge(int to, int nxt) : to(to), nxt(nxt) {}
        Edge() {}
    };

    Edge e[E];
    int head[N], match[M], ec;
    bool vis[N];

    void addEdge(int from, int to) {
        e[ec] = Edge(to, head[from]);
        head[from] = ec++;
    }
    void init(int n, int m) {
        ec = 0;
        for (int i = 0; i <= n; i++) head[i] = -1;
        for (int i = 0; i <= m; i++) match[i] = -1;
    }
    bool dfs(int x) {
        vis[x] = true;
        for (int i = head[x]; ~i; i = e[i].nxt) {
            int to = e[i].to, w = match[to];
            if (w == -1 || (!vis[w] && dfs(w))) {
                match[to] = x;
                return true;
            }
        }
        return false;
    }
    int bipatiteMatch(int n) {
        int ans = 0;
        for (int i = 0; i < n; i++) {
            memset(vis, 0, sizeof vis);
            if (dfs(i)) ans++;
        }
        return ans;
    }
};

Gragh g;

char s[N];
char sz[N] = "SMLXT";
PII a[N];

int main() {
    int n, x;
    while (scanf("%s", s) && strcmp(s, "ENDOFINPUT") != 0) {
        scanf("%d", &n);
        g.init(n, M-1);
        for (int i = 0; i < n; i++) {
            scanf("%s", s);
            int l = strchr(sz, s[0]) - sz;
            int r = strchr(sz, s[1]) - sz;
            a[i] = make_pair(l, r);
        }
        for (int i = 0; i < TSIZE; i++) {
            scanf("%d", &x);
            for (int j = 0; j < n; j++) {
                if (i < a[j].fi || i > a[j].se) continue;
                for (int k = 0; k < x; k++) {
                    g.addEdge(j, N * i + k);
                }
            }
        }
        puts(g.bipatiteMatch(n) == n ? "T-shirts rock!" : "I'd rather not wear a shirt anyway...");
        scanf("%s", s);
    }
    return 0;
}