因为要求的是只能修改一条弧,所以必定是修改最小割中的弧,于是枚举割做最大流。RujiaLiu给了两个优化。。
1.求完最大流后把流量留着,以后每次在它的基础上增广。
2.每次没必要求出最大流,增广到流量至少为C时就停下来就可以了。
Dinic模板:
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<stack>
#include<cmath>
#include<set>
#include<map>
#define LL long long
#define CLR(a, b) memset(a, b, sizeof(a))
using namespace std;
const int maxn = 110;
const int INF = 0x3f3f3f3f;
struct Edge
{
int from, to, cap, flow;
Edge() {}
Edge(int from, int to, int cap, int flow)
:from(from), to(to), cap(cap), flow(flow) {}
};
struct Dinic
{
int n, m, s, t;
vector<Edge> edges;
vector<int> G[maxn];
bool vis[maxn];
int d[maxn], cur[maxn];
void ClearAll(int n)
{
this->n = n; for(int i = 0; i < n; i ++) G[i].clear();
edges.clear();
}
void ClearFlow()
{
for(int i = 0; i < edges.size(); i ++)
edges[i].flow = 0;
}
void AddEdge(int from, int to, int cap)
{
edges.push_back(Edge(from, to, cap, 0));
edges.push_back(Edge(to, from, 0, 0));
m = edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
bool BFS()
{
CLR(vis, 0);
queue<int> Q;
Q.push(s);
vis[s] = 1;
d[s] = 0;
while(!Q.empty())
{
int x = Q.front();
Q.pop();
for(int i = 0; i < G[x].size(); i ++)
{
Edge& e = edges[G[x][i]];
if(!vis[e.to] && e.cap > e.flow)
{
vis[e.to] = 1;
d[e.to] = d[x] + 1;
Q.push(e.to);
}
}
}
return vis[t];
}
int DFS(int x, int a)
{
if(x == t || a == 0) return a;
int flow = 0, f;
for(int& i = cur[x]; i < G[x].size(); i++)
{
Edge& e = edges[G[x][i]];
if(d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap-e.flow))) > 0)
{
e.flow += f;
edges[G[x][i]^1].flow -= f;
flow += f;
a -= f;
if(a == 0) break;
}
}
return flow;
}
int Maxflow(int a, int t, int need)
{
this->s = s;
this->t = t;
int flow = 0;
while(BFS())
{
CLR(cur, 0);
flow += DFS(s, INF);
if(flow >= need) return flow;
}
return flow;
}
void Reduce()
{
for(int i = 0; i < edges.size(); i ++)
edges[i].cap -= edges[i].flow;
}
vector<int> Mincut()
{
vector<int> ans;BFS();
for(int i = 0; i < edges.size(); i ++)
{
Edge e = edges[i];
if(vis[e.from] && !vis[e.to] && e.cap > 0) ans.push_back(i);
}
return ans;
}
} sol;
vector<int> cut;
vector<pair<int, int> > ans;
int main()
{
int n, e, c, cas = 1;
while(scanf("%d%d%d", &n, &e, &c), n +e + c)
{
sol.ClearAll(n);
for(int i = 0; i < e; i ++)
{
int u, v, fp;
scanf("%d%d%d", &u, &v, &fp);
sol.AddEdge(-- u, -- v, fp);
}
int maxflow = sol.Maxflow(0, n - 1, c);
if(maxflow >= c)
printf("Case %d: possible\n", cas ++);
else
{
cut.clear();
cut = sol.Mincut();
sol.Reduce();
ans.clear();
for(int i = 0; i < cut.size(); i ++)
{
Edge& e = sol.edges[cut[i]];
sol.ClearFlow();
e.cap = c;
if(sol.Maxflow(0, n - 1, c - maxflow) >= c - maxflow)
ans.push_back(make_pair(e.from + 1, e.to + 1));
e.cap = 0;
}
if(ans.size() == 0) printf("Case %d: not possible\n", cas ++);
else
{
printf("Case %d: possible option:", cas ++);
sort(ans.begin(), ans.end());
for(int i = 0; i < ans.size(); i ++)
printf("(%d,%d)%c", ans[i].first, ans[i].second, i == ans.size() - 1? '\n' : ',');
}
}
}
}
ISAP模板:
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<stack>
#include<cmath>
#include<set>
#include<map>
#define LL long long
#define CLR(a, b) memset(a, b, sizeof(a))
using namespace std;
const int maxn = 110;
const int INF = 0x3f3f3f3f;
struct Edge
{
int from, to, cap, flow;
Edge() {}
Edge(int from, int to, int cap, int flow)
:from(from), to(to), cap(cap), flow(flow) {}
};
struct ISAP
{
int n, m, s, t;
vector<Edge> edges;
vector<int> G[maxn];
bool vis[maxn];
int d[maxn], cur[maxn];
int p[maxn], num[maxn];
void ClearAll(int n)
{
this->n = n;
for(int i = 0; i < n; i ++) G[i].clear();
edges.clear();
}
void ClearFlow()
{
for(int i = 0; i < edges.size(); i ++)
edges[i].flow = 0;
}
void AddEdge(int from, int to, int cap)
{
edges.push_back(Edge(from, to, cap, 0));
edges.push_back(Edge(to, from, 0, 0));
m = edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
bool BFS()
{
CLR(vis, false);
queue<int> Q;
Q.push(t);
vis[t] = 1; d[t] = 0;
while(!Q.empty())
{
int x = Q.front(); Q.pop();
for(int i = 0; i < G[x].size(); i ++)
{
Edge& e = edges[G[x][i]^1];
if(!vis[e.from] && e.cap > e.flow)
{
vis[e.from] = true;
d[e.from] = d[x] + 1;
Q.push(e.from);
}
}
}
return vis[s];
}
int Augment()
{
int x = t, a = INF;
while(x != s)
{
Edge& e = edges[p[x]];
a = min(a, e.cap-e.flow);
x = edges[p[x]].from;
}
x = t;
while(x != s)
{
edges[p[x]].flow += a;
edges[p[x]^1].flow -= a;
x = edges[p[x]].from;
}
return a;
}
int Maxflow(int s, int t, int need)
{
this->s = s; this->t = t;
int flow = 0;
BFS();CLR(num, 0);
for(int i = 0; i < n; i ++) num[d[i]] ++;
int x = s;
CLR(cur, 0);
while(d[s] < n)
{
if(x == t)
{
flow += Augment();
if(flow >= need) return flow;
x = s;
}
int ok = 0;
for(int i = cur[x]; i < G[x].size(); i ++)
{
Edge& e = edges[G[x][i]];
if(e.cap > e.flow && d[x] == d[e.to] + 1)
{
ok = 1;
p[e.to] = G[x][i];
cur[x] = i;
x = e.to;
break;
}
}
if(!ok)
{
int m = n - 1;
for(int i = 0; i < G[x].size(); i ++)
{
Edge& e = edges[G[x][i]];
if(e.cap > e.flow) m = min(m, d[e.to]);
}
if(-- num[d[x]] == 0) break;
num[d[x] = m + 1] ++;
cur[x] = 0;
if(x != s) x = edges[p[x]].from;
}
}
return flow;
}
void Reduce()
{
for(int i = 0; i < edges.size(); i ++)
edges[i].cap -= edges[i].flow;
}
vector<int> Mincut()
{
vector<int> ans;
BFS();
for(int i = 0; i < edges.size(); i ++)
{
Edge e = edges[i];
if(!vis[e.from] && vis[e.to] && e.cap > 0) ans.push_back(i);
}
return ans;
}
} sol;
vector<int> cut;
vector<pair<int, int> > ans;
int main()
{
int n, e, c, cas = 1;
while(scanf("%d%d%d", &n, &e, &c), n +e + c)
{
sol.ClearAll(n);
for(int i = 0; i < e; i ++)
{
int u, v, fp;
scanf("%d%d%d", &u, &v, &fp);
sol.AddEdge(-- u, -- v, fp);
}
int maxflow = sol.Maxflow(0, n - 1, c);
if(maxflow >= c)
printf("Case %d: possible\n", cas ++);
else
{
cut.clear();
cut = sol.Mincut();
sol.Reduce();
ans.clear();
for(int i = 0; i < cut.size(); i ++)
{
Edge& e = sol.edges[cut[i]];
sol.ClearFlow();
e.cap = c;
if(sol.Maxflow(0, n - 1, c - maxflow) >= c - maxflow)
ans.push_back(make_pair(e.from + 1, e.to + 1));
e.cap = 0;
}
if(ans.size() == 0) printf("Case %d: not possible\n", cas ++);
else
{
printf("Case %d: possible option:", cas ++);
sort(ans.begin(), ans.end());
for(int i = 0; i < ans.size(); i ++)
printf("(%d,%d)%c", ans[i].first, ans[i].second, i == ans.size() - 1? '\n' : ',');
}
}
}
}