题目链接
题意挺好理解的吧。我读着英文题面,然后就开始做了,就是说有N个男孩以及N个女孩,女孩要和那些可以做好朋友的男孩组队,当然,作为其他女孩的朋友的可作为男朋友的男孩也可以作为这位女孩的男朋友,…… 是不是说闺蜜的男友也是自己的???(信息量有点大QAQ)问题是这样的游戏可以玩几轮???(我的天…… 人渣的本愿)(逃…… )
思路:
最开始的时候,我想到的是直接去按时间跑下去最大流,就是每一刻时间,从源点向每个女生建立一条容量为1的边,如果最大流不为N则退出循环,否则,ans++。最后返回得到的结果也是很简单的…… T。仔细算一下,时间复杂度O(N*N*N*M)这样子当然会T。怎么处理?想了下,去二分答案吧,那么对应的源点到女生,还有男生到汇点就是需要每次重新建边了,时间复杂度可以优化到O(N*M*log(N*N))肯定不会T了。我们先要给初始状态保留下来,不然每次都去重新建边岂不是复杂,所以保留状态,copy下来,然后赋值上初始值,链式前向星上的head[]、cnt、edge[]都需要得到对应的copy。再去通过源点链接上女生边权为此时的二分答案,男生链接二分答案值的汇点。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define esp 1e-6
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 207, maxE = 2e4 + 7, S = 0;
int N, M, F, head[maxN], cur[maxN], cnt, root[maxN], T, copy_head[maxN], copy_cnt;
bool mp[105][105];
struct Eddge
{
int nex, to, flow;
Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), flow(c) {}
}edge[maxE], copy_edge[maxE];
inline void addEddge(int u, int v, int flow)
{
edge[cnt] = Eddge(head[u], v, flow);
head[u] = cnt++;
}
inline void _add(int u, int v, int flow) { addEddge(u, v, flow); addEddge(v, u, 0); }
int fid(int x) { return x == root[x] ? x : (root[x] = fid(root[x])); }
inline void mix(int x, int y)
{
int u = fid(x), v = fid(y);
if(u != v) root[u] = v;
}
int deep[maxN];
queue<int> Q;
bool bfs()
{
memset(deep, 0, sizeof(deep)); while(!Q.empty()) Q.pop(); Q.push(S); deep[S] = 1;
while(!Q.empty())
{
int u =Q.front(); Q.pop();
for(int i=head[u], v, f; ~i; i=edge[i].nex)
{
v = edge[i].to; f = edge[i].flow;
if(f && !deep[v])
{
deep[v] = deep[u] + 1;
Q.push(v);
}
}
}
return deep[T];
}
int dfs(int u, int dist)
{
if(u == T) return dist;
for(int &i=cur[u], v, f, di; ~i; i=edge[i].nex)
{
v = edge[i].to; f = edge[i].flow;
if(f && deep[v] == deep[u] + 1)
{
di = dfs(v, min(dist, f));
if(di)
{
edge[i].flow -= di;
edge[i^1].flow += di;
return di;
}
}
}
return 0;
}
int Dinic()
{
int ans = 0, tmp;
while(bfs())
{
for(int i=S; i<=T; i++) cur[i] = head[i];
while((tmp = dfs(S, INF))) ans += tmp;
}
return ans;
}
inline void init()
{
cnt = 0; T = (N<<1) + 1;
memset(head, -1, sizeof(head));
for(int i=1; i<=N<<1; i++) root[i] = i;
for(int i=1; i<=N; i++) for(int j=1; j<=N; j++) mp[i][j] = false;
}
int main()
{
int Cas; scanf("%d", &Cas);
while(Cas--)
{
scanf("%d%d%d", &N, &M, &F);
init();
for(int i=1, girl, boy; i<=M; i++)
{
scanf("%d%d", &girl, &boy);
mp[girl][boy] = true;
_add(girl, boy + N, 1);
}
for(int i=1, e1, e2; i<=F; i++)
{
scanf("%d%d", &e1, &e2);
mix(e1, e2);
}
for(int e1 = 1, u, v; e1 <= N; e1++)
{
u = fid(e1);
for(int e2 = e1 + 1; e2 <= N; e2++)
{
v = fid(e2);
if(u != v) continue;
for(int i=1; i<=N; i++)
{
if(mp[e1][i] && !mp[e2][i])
{
mp[e2][i] = true;
_add(e2, N + i, 1);
}
if(mp[e2][i] && !mp[e1][i])
{
mp[e1][i] = true;
_add(e1, N + i, 1);
}
}
}
}
for(int i=S; i<=T; i++) copy_head[i] = head[i];
for(int i=0; i<cnt; i++) copy_edge[i] = edge[i];
copy_cnt = cnt;
int ans = 0, L = 1, R = N * N, mid = 0;
while(L <= R)
{
mid = (L + R)>>1;
for(int i=S; i<=T; i++) head[i] = copy_head[i];
cnt = copy_cnt;
for(int i=0; i<cnt; i++) edge[i] = copy_edge[i];
for(int i=1; i<=N; i++) _add(S, i, mid);
for(int i=1; i<=N; i++) _add(N + i, T, mid);
if(Dinic() == mid * N)
{
L = mid + 1;
ans = mid;
}
else R = mid - 1;
}
printf("%d\n", ans);
}
return 0;
}