[BZOJ2561][最小生成树][最小割+dinic]
题目大意:
给定一个边带正权的连通无向图G=(V,E),其中N=|V|,M=|E|,N个点从1到N依次编号,给定三个正整数u,v,和L (u≠v),假设现在加入一条边权为L的边(u,v),那么需要删掉最少多少条边,才能够使得这条边既可能出现在最小生成树上,也可能出现在最大生成树上?
思路:
显然比L权值小的边会对最小生成树产生影响。
同理比L权值大的边会对最大生成树产生影响。
这样对这两个集合分别求一个最小割,两个结果相加就是答案。
代码:
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 20010;
const int Maxm = 1000005;
const int INF = 1 << 30;
inline int Max(const int &a, const int &b) {
return a > b ? a : b;
}
inline int Min(const int &a, const int &b) {
return a < b ? a : b;
}
inline char get(void) {
static char buf[100000], *p1 = buf, *p2 = buf;
if (p1 == p2) {
p2 = (p1 = buf) + fread(buf, 1, 100000, stdin);
if (p1 == p2) return EOF;
}
return *p1++;
}
inline void read(int &x) {
x = 0; static char c; bool f = 0;
for (; !(c >= '0' && c <= '9'); c = get()) if (c == '-') f = 1;
for (; c >= '0' && c <= '9'; x = x * 10 + c - '0', c = get()); if (f) x = -x;
}
struct E {
int u, v, w;
E(void) {}
E(const int &u, const int &v, const int &w) : u(u), v(v), w(w) {}
friend bool operator < (const E &a, const E &b) {
return a.w < b.w;
}
};
vector<E> e;
int head[Maxn], sub;
struct Edge {
int to, nxt, v;
Edge(void) {}
Edge(const int &to, const int &nxt, const int &v) : to(to), nxt(nxt), v(v) {}
} edge[Maxm];
inline void add(int a, int b, int v) {
edge[++sub] = Edge(b, head[a], v), head[a] = sub;
}
inline void insert(int u, int v) {
add(u, v, 1), add(v, u, 1);
}
int n, m, h[Maxn];
inline bool bfs(int S, int T) {
queue<int> qu;
memset(h, -1, sizeof h);
h[S] = 0; qu.push(S);
while (!qu.empty()) {
int u = qu.front(); qu.pop();
for (int i = head[u], v; i; i = edge[i].nxt) {
v = edge[i].to;
if (h[v] == -1 && edge[i].v) h[v] = h[u] + 1, qu.push(v);
}
}
return h[T] != -1;
}
inline int dfs(int T, int u, int flow) {
if (u == T) return flow;
int used = 0;
for (int i = head[u], v; i; i = edge[i].nxt) {
v = edge[i].to;
if (h[v] != h[u] + 1) continue;
int w = dfs(T, v, Min(flow, edge[i].v));
used += w; edge[i].v -= w; edge[i ^ 1].v += w;
if (used == flow) return flow;
}
if (used == 0) h[u] = -1;
return used;
}
inline int dinic(int U, int V) {
int ret = 0;
while (bfs(U, V)) ret += dfs(V, U, INF);
return ret;
}
int main(void) {
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
read(n), read(m);
for (int i = 1, x, y, z; i <= m; i++) {
read(x), read(y), read(z);
e.push_back(E(x, y, z));
}
int U, V, W, ans = 0;
read(U), read(V), read(W);
sort(e.begin(), e.end());
vector<E> ::iterator it;
for (sub = 1, it = e.begin(); it != e.end(); ++it) {
if ((*it).w < W) insert((*it).u, (*it).v);
else break;
}
ans += dinic(U, V);
for (memset(head, 0, sizeof head), sub = 1, it = e.end(), --it; it >= e.begin(); --it) {
if ((*it).w > W) insert((*it).u, (*it).v);
else break;
}
ans += dinic(U, V);
printf("%d\n", ans);
return 0;
}
完。
By g1n0st