两个CPU为原点和汇点,每个任务为一个顶点,在两个CPU上的花费分别连边,不能共享资源的额外花费连无向边
构图的解释。。虽然还是有点不理解
这样,该图的最小割中,原点和模块节点之间的边,或者模块节点与汇点之间的边至少一条在割之中。
同时,如果数据交换的结点选择了不同的核,那么他们之间的中边一定也在割集中 (如果不在,那么可以构造出更小的割)。
如果选择了相同的核,那么模块节点之间的那条表一定在割之中模块节点之间的那条表一定不在割之中(因为是最小割)。
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const double PI = acos(-1.0);
template <class T> inline T MAX(T a, T b){if (a > b) return a;return b;}
template <class T> inline T MIN(T a, T b){if (a < b) return a;return b;}
const int N = 22222;
const int M = 444444;
const LL MOD = 1000000007LL;
const int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const int INF = 0x3f3f3f3f;
struct arclist {
struct edge{int v, cap, next;} E[N + M << 1];
int head[N], cur;
inline void init()
{
memset(head, -1, sizeof(head)); cur = 0;
}
inline void add(int u, int v, int cap = 1) {
E[cur].v = v; E[cur].cap = cap;
E[cur].next = head[u]; head[u] = cur++;
E[cur].v = u; E[cur].cap = 0;
E[cur].next = head[v]; head[v] = cur++;
}
int SAP(int S, int T, int n)
{
int maxflow = 0, pre[N], dis[N] = {}, gap[N] = {};
int cur[N]; memcpy(cur, head, sizeof(cur));
gap[0] = n + 1; ++gap[dis[S] = 1];
for (int u = pre[S] = S; dis[S] <= n; ++gap[++dis[u]], u = pre[u])
{
for (bool flag = true; flag;)
{
flag = false;
for (int &p = cur[u]; ~p; p = E[p].next)
{
if (!E[p].cap || dis[u] != dis[E[p].v] + 1) continue;
flag = true; pre[E[p].v] = u; u = E[p].v;
if (u == T)
{
int aug = INF;
for (int i = S; i != T; i = E[cur[i]].v)
if (aug > E[cur[i]].cap)
{
u = i; aug = E[cur[i]].cap;
}
for (int i = S; i != T; i = E[cur[i]].v)
{
E[cur[i]].cap -= aug;
E[cur[i] ^ 1].cap += aug;
}
maxflow += aug;
}
break;
}
}
if (--gap[dis[u]] == 0) break;
dis[u] = n;
for (int p = head[u]; ~p; p = E[p].next)
if (E[p].cap && dis[u] > dis[E[p].v]) {dis[u] = dis[E[p].v]; cur[u] = p;}
}
return maxflow;
}
}flow;
int main()
{
int n, m;
while (scanf("%d%d", &n, &m) != EOF)
{
int i, j, k, u, v, w;
flow.init();
for (i = 1; i <= n; ++i)
{
scanf("%d%d", &u, &v);
flow.add(0, i, u);
flow.add(i, n + 1, v);
}
for (i = 0; i < m; ++i)
{
scanf("%d%d%d", &u, &v, &w);
flow.add(u, v, w);
flow.add(v, u, w);
}
printf("%d\n", flow.SAP(0, n + 1, n + 2));
}
return 0;
}