题目链接:点击这里
需要经过题目给出的边至少一次,也就是流量下界是1.另外有一类边:所有的点连向1,流量是无穷大费用是0. 对于有流量下界的点,就是经典的构造方法:对于
#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
#include <stack>
#define Clear(x,y) memset (x,y,sizeof(x))
#define FOR(a,b,c) for (int a = b; a <= c; a++)
#define REP(a,b,c) for (int a = b; a >= c; a--)
#define fi first
#define se second
#define pii pair<int, int>
#define pli pair<long long, int>
#define pb push_back
#define mod 1000000007
template <class T>
inline bool scan (T &ret) {
char c;
int sgn;
if (c = getchar(), c == EOF) return 0; //EOF
while (c != '-' && (c < '0' || c > '9') ) c = getchar();
sgn = (c == '-') ? -1 : 1;
ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
ret *= sgn;
return 1;
}
using namespace std;
#define maxn 305
#define maxm 500005
#define type int
#define INF 1e8
int n, m;
int s, t;
struct node {
int u, v, next;
type cap, flow, cost;
}edge[maxm];
int head[maxn], cnt;
int pre[maxn];
type dis[maxn];
bool vis[maxn];
int N;
void init () {
memset (head, -1, (n+5)*sizeof head[0]);
cnt = 0;
}
void add_edge (int u, int v, type cap, type cost) {
edge[cnt].u = u, edge[cnt].v = v, edge[cnt].cap = cap, edge[cnt].flow = 0;
edge[cnt].cost = cost, edge[cnt].next = head[u], head[u] = cnt++;
edge[cnt].u = v, edge[cnt].v = u, edge[cnt].cap = 0, edge[cnt].flow = 0;
edge[cnt].cost = -cost, edge[cnt].next = head[v], head[v] = cnt++;
}
bool spfa (int s, int t) {
queue <int> q;
for (int i = 0; i < N; i++) {
dis[i] = INF;
vis[i] = 0;
pre[i] = -1;
}
dis[s] = 0;
vis[s] = 1;
q.push (s);
while (!q.empty ()) {
int u = q.front (); q.pop ();
vis[u] = 0;
for (int i = head[u]; i != -1; i = edge[i].next) {
int v = edge[i].v;
if (edge[i].cap > edge[i].flow && dis[v] > dis[u]+edge[i].cost) {
dis[v] = dis[u]+edge[i].cost;
pre[v] = i;
if (!vis[v]) {
vis[v] = 1;
q.push (v);
}
}
}
}
if (pre[t] == -1)
return 0;
else
return 1;
}
int MCMF (int s, int t, type &cost) {
type flow = 0;
cost = 0;
while (spfa (s, t)) {
type Min = INF;
for (int i = pre[t]; i != -1; i = pre[edge[i^1].v]) {
if (Min > edge[i].cap-edge[i].flow) {
Min = edge[i].cap-edge[i].flow;
}
}
for (int i = pre[t]; i != -1; i = pre[edge[i^1].v]) {
edge[i].flow += Min;
edge[i^1].flow -= Min;
cost += edge[i].cost*Min;
}
flow += Min;
}
return flow;
}
int main () {
//freopen ("more.in", "r", stdin);
while (scanf ("%d", &n) == 1) {
init ();
N = n+2;
int s = 0, t = n+1;
for (int i = 1; i <= n; i++) {
int num; scan (num);
for (int j = 1; j <= num; j++) {
int v, cost; scan (v); scan (cost);//流量下界是1
add_edge (i, v, INF, cost);
add_edge (s, v, 1, cost);
}
add_edge (i, t, num, 0);
}
for (int i = 2; i <= n; i++) add_edge (i, 1, INF, 0);//这类边没有下界
int cost;
int flow = MCMF (s, t, cost);
printf ("%d\n", cost);
}
return 0;
}