题目连接
题意:
现有 N 个不同类型的插座, 每个 插座只有一个,
M个用电器,每个用电器只能插到一个插座上,
K个转换器,每个转化器有无数个(因为你可以在附近的店买)
思路:
1)读题画图,目标求出最少有几个用电器用不成(我们需要求最多有几个用电器能用,好像可以最大匹配,最大流)画完图后,然后最大匹配尝试失败,最大流,画个源点和汇点。
2)这种题 ,就是网络流的板子 ,这个题建图还比较好建图,然后 Dinic 跑一下最大流
3)最后求的是最后有几个用电器用不成 M - 最大流。
AC代码
#include<cstring>
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
const int maxn = 10005;
const int maxm = 1000005;
const int inf = 0x3f3f3f3f;
int N, M, K;
int s = 0, e = 500;
struct ac{
int v, c, nex;
}edge[maxm];
int head[maxn], dis[maxn], curedge[maxn], cnt;
void init() {
cnt = 0;
memset(head, -1, sizeof(head));
}
void addedge(int u, int v, int c) {
// 正向建边
edge[cnt] = {v, c, head[u]};
head[u] = cnt++;
// 反向建边, 流量为0
edge[cnt] = {u, 0, head[v]};
head[v] = cnt++;
}
bool bfs() {
queue<int> que;
que.push(s);
memset(dis, 0, sizeof(dis)); // 对图进行分层
dis[s] = 1;
while (!que.empty()) {
int u = que.front();
que.pop();
for (int i = head[u]; i != -1; i = edge[i].nex) {
int v = edge[i].v;
int c = edge[i].c;
// 如果节点v已经分过层或者u->v流量为0, continue
if (dis[v] || c == 0) continue;
dis[v] = dis[u] + 1; // 对v进行标记并加入队列
que.push(v);
}
}
return dis[e] > 0; // 判断是否存在增广路,s是否能到达e
}
int dfs(int u, int flow) { // 增广路走到u点的最小流量为flow
if (u == e || flow == 0) return flow;
// 遍历u的所有出边
for (int &i = curedge[u]; i != -1; i = edge[i].nex) { // 当前弧优化
int v = edge[i].v;
int c = edge[i].c;
// 判断能否u->v增广
if (dis[v] != dis[u] + 1 || c == 0) continue;
int d = dfs(v, min(flow, c));
if (d > 0) { // 找到一条增广路,修改增广路上的正反向边
edge[i].c -= d;
edge[i^1].c += d;
return d;
}
}
dis[u] = -1; // // 炸点优化
return 0;
}
int Dinic() {
int sum = 0, d;
while (bfs()) { // 判读是否存在增广路
for (int i = 0; i <= e; ++i) curedge[i] = head[i]; // copy head数组,在dfs中可以直接得到下一条没有被增广过的边
while ((d = dfs(s, inf)) > 0) sum += d; // 多次dfs找增广路
}
return sum;
}
int main(){
while(cin >> N){
init();
string s1;
map<string, int> mp1; // 存插座
int q = 1;
for (int i = 0; i < N; i++) {
cin >> s1;
if(mp1[s1] == 0)
mp1[s1] = q++;
addedge(mp1[s1], e, 1);
}
cin >> M;
string s2;
map<string, int> mp2;
for (int i = 0; i < M; ++i) {
cin >> s1 >> s2;
if(mp2[s1] == 0){
mp2[s1] = q++;
addedge(s, mp2[s1], 1);
}
if(mp1[s2] == 0)
mp1[s2] = q++;
addedge(mp2[s1], mp1[s2], 1);
}
cin >> K;
for (int i = 0; i < K; ++i) {
cin >> s1 >> s2;
if(mp1[s2] == 0)
mp1[s2] = q++;
if(mp1[s1] == 0)
mp1[s1] = q++;
addedge(mp1[s1], mp1[s2], inf);
}
cout << M - Dinic() << endl;
}
return 0;
}
附上 网络流的学习路径:
几位大佬
https://www.cnblogs.com/rvalue/p/10650849.html
https://blog.csdn.net/txl199106/article/details/64441994
https://blog.csdn.net/yo_bc/article/details/72825629
https://www.cnblogs.com/SYCstudio/p/7260613.html
https://www.cnblogs.com/rmy020718/p/9546071.html
板子
https://blog.csdn.net/henuyh/article/details/80637636
https://blog.csdn.net/henuyh/article/details/81976188