分析:Dinic没什么好说的,问题就是出在建图之上。
一种建图思路:
- 将所有的男生、女生,作为一个节点并且每个节点引出并指向两个新的节点分别表示’不喜欢’和‘’喜欢’两个节点。建立超级源点S 和 超级汇点 T,通过 S 指向每个男生的主节点,每个女生的主节点指向T,来表示流量。
- 二分答案,该答案等于每一条从S指向男生主节点的边权,同时等于每个女生主节点指向T的边权。
- 将每个男生女生互相喜欢的互相建立权值为1的边,同时将每一组不喜欢的人的相互边建立权值为0。
- 每个男生女生,指向喜欢的次结点的权值为n(或INF),指向不喜欢的人的结点的权值为k,同时建立反边。
- M i d ∗ n < = D i n i c ( ) Mid*n <= Dinic() Mid∗n<=Dinic()作为二分的判断依据。
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<string>
#include<map>
#include<queue>
#include<vector>
using namespace std;
#define ll long long int
#define LL ll
#define INF 0x3f3f3f3f
const int maxn = 3000 + 10;
const int maxe = 1e6;
struct edge {
int to, nx, w;
}e[maxe];
int sz;
int head[maxn];
int dep[maxn], flow[maxn];
int n, m, k, S, T;
char mp[55][55];
int a[55][55];
void init() {
sz = 0;
memset(head, -1, sizeof head);
memset(a, 0, sizeof a);
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%s", mp[i] + 1);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (mp[i][j] == 'Y') { // Y -> 1 means love each other. O means dislike.
a[i][j] = 1;
}
}
}
/*for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cout << a[i][j];
}
cout << endl;
}*/
}
void add(int u, int v, int w) {
e[sz].to = v;
e[sz].nx = head[u];
e[sz].w = w;
head[u] = sz++; // sz ^ 1 = sz + 1(so sz must be an even number) sz ^ 1 is sz's reverse edge.
}
bool bfs() {
memset(dep, 0, sizeof dep);
dep[S] = 1; // S = 0
queue<int> Q;
Q.push(S); // S = 0
while (!Q.empty()) {
int nw = Q.front();
Q.pop();
for (int i = head[nw]; i != -1; i = e[i].nx) {
int v = e[i].to;
if (!dep[v] && e[i].w) { // exist room & haven't been visited
dep[v] = dep[nw] + 1;
Q.push(v);
}
}
}
return dep[T];// if dep[T] == 0, means no roads to T now;
}
int dfs(int nw, int flow) {
if (flow == 0 || nw == T) return flow;
int res = 0;
for (int i = head[nw]; i != -1; i = e[i].nx) {
//head[nw] = i;当前弧优化(比较弱的优化)
int v = e[i].to;
if (e[i].w&&dep[v] == dep[nw] + 1) { // find the road
int cur = dfs(v, min(flow, e[i].w));
flow -= cur; res += cur;
e[i].w -= cur; e[i ^ 1].w += cur;
}
}
if (!res) dep[nw] = 0; // the cutting of boom the node
return res;
}
int dinic() {
int res = 0;
while (bfs()) {
res += dfs(S, INF);
}
return res;
}
void build(int v) {
sz = 0;
memset(head, -1, sizeof head);// WA point
S = 0; T = 3 * n * 2 + 1;
int id = 1;
for (int i = 1; i <= n; i++) {//boys
add(S, id, v); add(id, S, 0);
id++;
add(id - 1, id, INF); add(id, id - 1, 0);// love
id++;
add(id - 2, id, k); add(id, id - 2, 0); //dislike
id++;
}
for (int i = 1; i <= n; i++) {//girls
add(id, T, v); add(T, id, 0);
id++;
add(id, id - 1, INF); add(id - 1, id, 0);
id++;
add(id, id - 2, k); add(id - 2, id, 0);
id++;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][j]) {
int u = i * 3 - 3 + 2;
int v = n * 3 + j * 3 - 3 + 2;
add(u, v, 1);
add(v, u, 0);
}
else {
int u = i * 3 - 3 + 3;
int v = n * 3 + j * 3 - 3 + 3;
add(u, v, 1);
add(v, u, 0);
}
}
}
}
int main()
{
init();
int L = 0, R = 50, M, Ans = 0;
while (L <= R) {
M = (L + R) >> 1;
build(M);
int Res = dinic();
if (M * n <= Res) {
Ans = M;
L = M + 1;
}
else R = M - 1;
}
printf("%d\n", Ans);
return 0;
}
//_CRT_SECURE_NO_WARNINGS