题意:给你一个有向无环图的技能树,通常地学习某个技能需要学习全部的前置技能,并且需要一定的花费,但你可以通过氪金来消掉某个前置关系或者直接强行习得某个技能,问要学习某个特定的技能需要的最小花费;
一开始和队友讨论了下,感觉是树状dp,但是想了想,状态似乎没法转移……
正解是最小割,转换成最大流来做(网络流还是不熟练啊……)
解法大致如下:
1.对于每个技能i,将它拆成标号为i和n+i的两个点,从i向n+i连边,容量为强行氪出这个技能的花费;
2.对于强行去掉前置条件,比如a是b的前置这个条件,从n+a向b连边,容量为去掉这个技能的花费;
3.建个源点,标号为0好了~对于每个技能,连一条从0到i的边,容量为用通常方法学习这个技能的花费;
4.设目标技能是第j号技能,从n+j向汇点连边,容量为INF;
5.跑一边最大流就ok了。
原因是对于每个获得目标技能的方法,都可以表示为原图的一个割,我们要找的就是最小花费的割,所以转换成网络流来做……
#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cctype>
#include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<set>
#include<algorithm>
#include<stack>
//#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
const int INF = 0x7fffffff;
typedef long long ll;
const double eps = 1e-8;
const double PI = 2 * cos(0.0);
const int MOD = 1000000007;
#define MAXN 100001
int T, n, m, s, x, y, z, cnt;
int head[MAXN], pre[MAXN];
int gap[MAXN], level[MAXN], cur[MAXN];
struct Node
{
int v, cap, next;
Node(){}
Node(int v, int cap, int next) :v(v), cap(cap), next(next){}
}Edge[MAXN];
void AddEdge(int u, int v, int cap)
{
Edge[cnt++] = Node(v, cap, head[u]);
Edge[cnt++] = Node(u, 0, head[v]);
head[u] = cnt - 2;
head[v] = cnt - 1;
}
int ISAP(int vs, int vt, int n)
{
int res = 0;
for (int i = 0; i<n; i++)
cur[i] = head[i];
pre[vs] = vs;
gap[0] = n;
int aug = INF;
int u = vs;
for (; level[vs] < n;)
{
bool flag = 0;
for (int i = cur[u]; i != -1; i = Edge[i].next)
{
int v = Edge[i].v;
if (Edge[i].cap && level[u] == level[v] + 1)
{
flag = 1;
pre[v] = u;
cur[u] = i;
u = v;
aug = min(aug, Edge[i].cap);
break;
}
}
if (!flag)
{
int mh = n;
for (int i = head[u]; i != -1; i = Edge[i].next)
{
int v = Edge[i].v;
if (Edge[i].cap && level[v] < mh)
{
mh = level[v];
cur[u] = i;
}
}
if (!--gap[level[u]]) break;
gap[level[u] = mh + 1]++;
u = pre[u];
}
else if (u == vt)
{
for (; u != vs; u = pre[u])
{
int v = pre[u];
Edge[cur[v]].cap -= aug;
Edge[cur[v] ^ 1].cap += aug;
}
res += aug, aug = INF;
}
}
return res;
}
int main()
{
cin >> T;
while (T--)
{
cin >> n >> m >> s;
mem(head, -1);
mem(gap, 0);
mem(pre, -1);
mem(level, 0);
cnt = 0;
for (int i = 0; i < m; i++)
{
scanf("%d%d%d", &x, &y, &z);
AddEdge(n + x, y, z);
}
for (int i = 1; i <= n; i++)
{
scanf("%d", &x);
AddEdge(0, i, x);
}
for (int i = 1; i <= n; i++)
{
scanf("%d", &x);
AddEdge(i, n + i, x);
}
AddEdge(n + s, n + n + 1, INF);
cout << ISAP(0, n + n + 1, n + n + 2) << endl;
}
return 0;
}