题目链接
题意:这道题的题面确实是太长了,但是看了一下样例,再推就是这么个意思(看样例猜题意猜中系列),题意是这样的,有N个插座(可能有些用电器是没有已经提供的插座的,需要转接),但是每个列写出来的插座的个数只有一个,以及M个用电器它们都有对应的唯一的指定插座,还有K个转接方式,转接线可以无限次使用,要问的是最少有多少的用电器是没法供上电的。
思路:我们可以这么考虑,从源点给予每个插座一条值为1的边,然后再对所有的用电器,从其唯一指定的插座连出一条值为1的边,那么接下去就是转接口了,怎么处理转接口的问题呢?譬如说可以把A用B来代替,那么不就是从B连一条通往A的边即可?但是由于B也可以通过别的转换得到,所以我们转接口的权值设定为INF。
#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 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 = 307;
const int maxE = 2e6 + 7;
const int S = 0, T = 301;
int N, M, K, head[maxN], cnt, num;
struct Eddge
{
int nex, to, val;
Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), val(c) {}
}edge[maxE];
inline void addEddge(int u, int v, int val)
{
edge[cnt] = Eddge(head[u], v, val);
head[u] = cnt++;
}
int deep[maxN];
queue<int> Q;
bool bfs()
{
memset(deep, 0, sizeof(deep));
while(!Q.empty()) Q.pop();
deep[S] = 1; Q.push(S);
while(!Q.empty())
{
int u = Q.front(); Q.pop();
for(int i=head[u], v, val; ~i; i=edge[i].nex)
{
v = edge[i].to; val = edge[i].val;
if(!deep[v] && val)
{
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=head[u], v, val, tmp; ~i; i=edge[i].nex)
{
v = edge[i].to; val = edge[i].val;
if(deep[v] == deep[u] + 1 && val)
{
if((tmp = dfs(v, min(dist, val))))
{
edge[i].val -= tmp;
edge[i^1].val += tmp;
return tmp;
}
}
}
return 0;
}
int Dinic()
{
int ans = 0, tmp = 0;
while(bfs()) if((tmp = dfs(S, INF))) ans += tmp;
return ans;
}
inline void init()
{
cnt = 0; num = N;
memset(head, -1, sizeof(head));
}
char str1[27], str2[27];
int main()
{
while(scanf("%d", &N)!=EOF)
{
map<string, int> mp;
init();
for(int i=1; i<=N; i++)
{
scanf("%s", str1);
mp[str1] = i;
addEddge(S, i, 1);
addEddge(i, S, 0);
}
scanf("%d", &M);
for(int i=1; i<=M; i++)
{
scanf("%s%s", str1, str2);
if(!mp[str1]) mp[str1] = ++num;
if(!mp[str2]) mp[str2] = ++num;
addEddge(mp[str2], mp[str1], 1);
addEddge(mp[str1], mp[str2], 0);
addEddge(mp[str1], T, 1);
addEddge(T, mp[str1], 0);
}
scanf("%d", &K);
for(int i=1; i<=K; i++)
{
scanf("%s%s", str1, str2);
if(!mp[str1]) mp[str1] = ++num;
if(!mp[str2]) mp[str2] = ++num;
addEddge(mp[str2], mp[str1], INF);
addEddge(mp[str1], mp[str2], 0);
}
printf("%d\n", M - Dinic());
}
return 0;
}