题目:
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1532
题意:
N个城市,M个中中转站,L条有向边(表示从u到v的容量为c),总部t为节点0,。问要增加哪条边的容量才能使得总容量增加,输出边的id。
思路:
做一次最大流之后,寻找参与网络中满足条件的割(u,v),
条件为: 1.满流;2.源点s可达u,v可达汇点t。
做法是一次最大流之后,做两次dfs,分别从s,t开始,若s(t)可达的点且容量有剩余,则标记为可达点。
最后询问所有的边(u,v),容量为0且可达,则记录答案。
虽然是看论文来的思路,但是1A,还是很兴粪的! go on !
AC.
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 205;
int N, M, L;
int viss[maxn], vist[maxn];
int ans[maxn];
struct edge {
int to, cap, rev, id;
edge(int t, int c, int r, int d) {
to = t; cap = c; rev = r; id = d;
}
};
vector<edge> g[maxn];
int level[maxn], iter[maxn];
void addedge(int from, int to, int cap, int id)
{
g[from].push_back(edge(to, cap, g[to].size(), id));
g[to].push_back(edge(from, 0, g[from].size()-1, id+L+1));
}
void bfs(int s)
{
memset(level, -1, sizeof(level));
queue<int> que;
level[s] = 0;
que.push(s);
while(!que.empty()) {
int v = que.front(); que.pop();
for(int i = 0; i < g[v].size(); ++i) {
edge &e = g[v][i];
if(e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
int dfs(int v, int t, int f)
{
if(v == t) return f;
for(int &i = iter[v]; i < g[v].size(); ++i) {
edge &e = g[v][i];
if(e.cap > 0 && level[v] < level[e.to]) {
int d = dfs(e.to, t, min(f, e.cap));
if(d > 0) {
e.cap -= d;
g[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t)
{
int flow = 0;
while(1) {
bfs(s);
if(level[t] < 0) return flow;
memset(iter, 0, sizeof(iter));
int f;
while((f = dfs(s, t, INF)) > 0) {
flow += f;
}
}
}
void dfs1(int x)
{
viss[x] = 1;
for(int i = 0; i < g[x].size(); ++i) {
edge e = g[x][i];
if(e.id <= L && e.cap && !viss[e.to]) dfs1(e.to);
}
}
void dfs2(int x)
{
vist[x] = 1;
for(int i = 0; i < g[x].size(); ++i) {
edge e = g[x][i];
if(e.id > L && g[e.to][e.rev].cap && !vist[e.to]) dfs2(e.to);
}
}
int main()
{
// freopen("in", "r", stdin);
while(~scanf("%d%d%d", &N, &M, &L)) {
if(N == 0 && M == 0 && L == 0) break;
for(int i = 0; i <= N+M+1; ++i) g[i].clear();
int t = 0, s = N+M+1;
for(int i = 0; i < L; ++i) {
int u, v, c;
scanf("%d%d%d", &u, &v, &c);
addedge(u, v, c, i);
}
for(int i = 1; i <= N; ++i) {
addedge(s, i, INF, L);
}
int an = max_flow(s, t);
memset(viss, 0, sizeof(viss));
memset(vist, 0, sizeof(vist));
memset(ans, 0, sizeof(ans));
int k = 0;
dfs1(s);
dfs2(t);
for(int i = 1; i <= N+M; ++i) {
for(int j = 0; j < g[i].size(); ++j) {
edge e = g[i][j];
if(e.id < L && e.cap <= 0 && viss[i] && vist[e.to]) {
ans[k++] = e.id+1;
}
}
}
if(k == 0) printf("\n");
else {
sort(ans, ans+k);
printf("%d", ans[0]);
for(int i = 1; i < k; ++i) {
printf(" %d", ans[i]);
}
printf("\n");
}
}
return 0;
}