题目地址:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5276
思路:最小割。将每个点拆成 i 和 i',设一个源点与汇点。
1.对于边i--->j,连边i'--->j,容量为对应边的费用。
2.源点到 i 连边,容量为满足条件后购买 i 的费用。
3.对于 i 和 i' 连边,容量为直接购买 i 的费用。
4.对于目标点向汇点连边,容量为INF。
因为图中每个割为一种获得目标技能的方案,所以求最小割即可。
#include<cstdio>
#include<queue>
#include<vector>
#include<cstring>
#include<algorithm>
#define debu
using namespace std;
const int maxn = 1010;
const int INF = 0x3f3f3f3f;
struct Edge
{
int from, to, cap, flow;
Edge(int a,int b,int c,int d):from(a),to(b),cap(c),flow(d) {}
};
int n,m,goal;
struct Dinic
{
int n, m, s, t;
vector<Edge> edges;
vector<int> G[maxn];
bool vis[maxn];
int d[maxn];
int cur[maxn];
void init(int n)
{
this->n=n;
for(int i = 0; i <= n; i++) G[i].clear();
edges.clear();
}
void addedge(int from, int to, int cap)
{
edges.push_back(Edge(from,to,cap,0));
edges.push_back(Edge(to,from,0,0));
int m = edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
bool BFS()
{
memset(vis, 0, sizeof(vis));
queue<int> Q;
Q.push(s);
vis[s] = 1;
d[s] = 0;
while(!Q.empty())
{
int x = Q.front();
Q.pop();
for(int i = 0; i < G[x].size(); i++)
{
Edge& e = edges[G[x][i]];
if(!vis[e.to] && e.cap > e.flow)
{
vis[e.to] = 1;
d[e.to] = d[x] + 1;
Q.push(e.to);
}
}
}
return vis[t];
}
int DFS(int x, int a)
{
if(x == t || a == 0) return a;
int flow = 0, f;
for(int& i = cur[x]; i < G[x].size(); i++)
{
Edge& e = edges[G[x][i]];
if(d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap-e.flow))) > 0)
{
e.flow += f;
edges[G[x][i]^1].flow -= f;
flow += f;
a -= f;
if(a == 0) break;
}
}
return flow;
}
int Maxflow(int s, int t)
{
this->s = s;
this->t = t;
int flow = 0;
while(BFS())
{
memset(cur, 0, sizeof(cur));
flow += DFS(s, INF);
}
return flow;
}
};
Dinic g;
int main()
{
#ifdef debug
freopen("in.in","r",stdin);
#endif // debug
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&m,&goal);
g.init(2*n+1);
for(int i=0; i<m; i++)
{
int x,y,c;
scanf("%d%d%d",&x,&y,&c);
g.addedge(x+n,y,c);
}
for(int i=1; i<=n; i++)
{
int x;
scanf("%d",&x);
g.addedge(0,i,x);
}
for(int i=1; i<=n; i++)
{
int x;
scanf("%d",&x);
g.addedge(i,i+n,x);
}
g.addedge(goal,2*n+1,INF);
int ans=g.Maxflow(0,2*n+1);
printf("%d\n",ans);
}
return 0;
}