题目:http://www.lightoj.com/volume_showproblem.php?problem=1176
题意:T恤有6种尺寸,每种有n种颜色,每种颜色各有一件,也就是每种尺寸的T恤有n件,有m个学生,每个学生只适合其中的两个尺寸,不在意颜色,问能不能让所有的学生拿到适合的T恤。输入形式:首先一个t,代表样例数,然后是n m,如上所说。然后是m行,每行两个字符串,代表每个学生适合的两个尺寸。
思路:首先给定的尺寸是用字符串表示的,那我们将字符串映射为数字1-6。对于每个学生,因为只能选择一件,所以与源点连一条容量为1的边,与适合的尺寸连一条容量为1的边。对于T恤,因为每种有n个,那么和汇点连一条容量为n的边,代表每种T恤能被选n次
总结:我以前用匈牙利匹配做过这道题,因为是匈牙利匹配是单个匹配,所以要把所有的衣服全部拆成单个的,很麻烦,用最大流就很方便了
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
const int N = 110;
const int INF = 0x3f3f3f3f;
struct edge
{
int to, cap, next;
}g[N*100];
int head[N], iter[N], level[N];
int n, m, cnt, _case = 0;
map<string, int> mpa;
void add_edge(int v, int u, int cap)
{
g[cnt].to = u, g[cnt].cap = cap, g[cnt].next = head[v], head[v] = cnt++;
g[cnt].to = v, g[cnt].cap = 0, g[cnt].next = head[u], head[u] = cnt++;
}
bool bfs(int s, int t)
{
memset(level, -1, sizeof level);
level[s] = 0;
queue<int> que;
que.push(s);
while(! que.empty())
{
int v = que.front(); que.pop();
for(int i = head[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(g[i].cap > 0 && level[u] < 0)
{
level[u] = level[v] + 1;
que.push(u);
}
}
}
return level[t] == -1;
}
int dfs(int v, int t, int f)
{
if(v == t) return f;
for(int &i = iter[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(g[i].cap > 0 && level[v] < level[u])
{
int d = dfs(u, t, min(g[i].cap, f));
if(d > 0)
{
g[i].cap -= d, g[i^1].cap += d;
return d;
}
}
}
return 0;
}
int dinic(int s, int t)
{
int flow = 0, f;
while(true)
{
if(bfs(s, t)) return flow;
memcpy(iter, head, sizeof head);
while(f = dfs(s, t, INF), f > 0)
flow += f;
}
}
void table()//将代表尺寸的字符串映射成数字
{
mpa["XXL"] = 1;
mpa["XL"] = 2;
mpa["L"] = 3;
mpa["M"] = 4;
mpa["S"] = 5;
mpa["XS"] = 6;
}
int main()
{
int t;
char s1[10], s2[10];
table();
scanf("%d", &t);
while(t--)
{
cnt = 0;
memset(head, -1, sizeof head);
scanf("%d%d", &n, &m);
for(int i = 1; i <= m; i++)
{
scanf(" %s %s", s1, s2);
int a = mpa[s1], b = mpa[s2];
add_edge(i, m + a, 1);
add_edge(i, m + b, 1);
add_edge(0, i, 1);
}
for(int i = 1; i <= 6; i++)
add_edge(m + i, m + 6 + 1, n);
printf("Case %d: ", ++_case);
if(dinic(0, m + 6 + 1) >= m) printf("YES\n");
else printf("NO\n");
}
return 0;
}