题意:
输入n, m,f。表示有n个女生和n个男生,m行u, v表示编号u和v的女生和男生可以结婚,f行u,v表示编号为u,v的女生相互是朋友,朋友关系具有传递性,对于女生来说朋友的结婚对象也可以是她的结婚对象,问可以有多少中不同的结婚组合方式。
思路:
简单来说这里是要求最大匹配数,对女生和可以和她结婚的男生连边,权值设为1,然后二分源点到女生的边的权值,权值表示每个女生最多可以与多少个男生结婚。跑最大流判断是否满足。
code:
#include<iostream>
#include<queue>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 3e2 + 5;
const int inf = 1e7 + 5;
struct edges{
int u, v, w, next;
} g[maxn * maxn];
int head[maxn], dep[maxn], gap[maxn], cnt;
int mp[maxn][maxn];
void init(int n){
cnt = 0;
for(int i = 0; i <= n; i++){
head[i] = -1;
}
}
void add(int u, int v, int w){
g[cnt].u = u;
g[cnt].v = v;
g[cnt].w = w;
g[cnt].next = head[u];
head[u] = cnt++;
}
void bfs(int n, int t){
for(int i = 0; i <= n; i++){
dep[i] = -1;
}
queue<int> qu;
while(qu.size()) qu.pop();
qu.push(t);
dep[t] = 0;
while(qu.size()){
int u = qu.front();
qu.pop();
for(int i = head[u]; i != -1; i = g[i].next){
int v = g[i].v;
if(g[i ^ 1].w > 0 && dep[v] == -1) dep[v] = dep[u] + 1, qu.push(v);
}
}
for(int i = 0; i <= n; i++)
gap[i] = 0;
for(int i = 0; i <= n; i++)
gap[dep[i]]++;
}
int dfs(int n, int s, int t, int u, int limit){
if(u == t || limit == 0){
return limit;
}
int flow = 0, f;
bool flag = true;
for(int i = head[u]; i != -1; i = g[i].next){
int v = g[i].v;
if( g[i].w > 0 && dep[u] == dep[v] + 1 && (f = dfs(n, s, t, v, min(g[i].w, limit))) ){
g[i].w -= f;
g[i ^ 1].w += f;
limit -= f;
flow += f;
flag = false;
}
}
if(flag){
int min_dep = n - 1;
for(int i = head[u]; i != -1; i = g[i].next)
if(g[i].w > 0) min_dep = min(min_dep, dep[g[i].v]);
if(--gap[dep[u]] <= 0) dep[s] = n;
dep[u] = min_dep + 1;
gap[dep[u]]++;
}
return flow;
}
int isap(int n, int s, int t){
bfs(n, t);
int flow = 0;
while(dep[s] < n){
flow += dfs(n, s, t, s, inf);
}
return flow;
}
void build(int mid, int n){
init(202);
int s = 201, t = 202;
for(int i = 1; i <= n; i++){
add(s, i, mid);
add(i, s, 0);
}
for(int i = n + 1; i <= n * 2; i++){
add(i, t, mid);
add(t, i, 0);
}
for(int i = 1; i <= n; i++)
for(int j = n + 1; j <= n * 2; j++)
if(mp[i][j]){
add(i, j, 1);
add(j, i, 0);
}
}
bool judge(int mid, int n){
build(mid, n);
int s = 201, t = 202;
int flow = isap(202, s, t);
return flow == mid * n;
}
int main(){
int T, n, m, f;
int u, v;
scanf("%d", &T);
while(T--){
scanf("%d%d%d", &n, &m, &f);
memset(mp, 0, sizeof(mp));
for(int i = 0; i < m; i++){
scanf("%d%d", &u, &v);
mp[u][v + n] = 1;
}
for(int i = 0; i < f; i++){
scanf("%d%d", &u, &v);
mp[u][v] = 1;
mp[v][u] = 1;
}
for(int k = 1; k <= n * 2; k++) //这里使用flody跑闭环,想要高效一点可以用并查集
for(int i = 1; i <= n * 2; i++)
for(int j = 1; j <= n * 2; j++)
if(k == i || k == j || i == j) continue;
else mp[i][j] = mp[i][j] || (mp[i][k] && mp[k][j]);
//
// for(int i = 1; i <= n * 2; i++){
// for(int j = 1; j <= n * 2; j++)
// printf("%d ", mp[i][j]);
// printf("\n");
// }
int l = 0, r = n; //二分答案
while(l < r){
int mid = (l + r) / 2;
if(judge(mid + 1, n)) l = mid + 1;
else r = mid;
}
printf("%d\n", l);
}
}