·· / ·– ·· ·-·· ·-·· / ·–· · ·-· ··· ·· ··· - / ··- -· - ·· ·-·· / ·· / ·– ·· -·
题目来源:http://www.lydsy.com/JudgeOnline/problem.php?id=3130
这题比较容易想到是最大流+二分,二分流量上界,答案=最小流量上界*p
但是这题的重点在于,最大流本身是一定的整数,但是为满足最优解,某一条边的流量可以是实数。所以这题是实数网络流!
还好出题人给人留活路,只考虑整数的情况能水50分。。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
const int N=200,M=4000,inf=0x3fffffff;
int head[N],ver[M<<1],nxt[M<<1],tot=1;
double e[M<<1],b[M<<1];
int d[N]; queue<int> q;
int T,n,m,p,s,t;
double maxflow=0,myflow=0;
void add (int u,int v,int w) {
ver[++tot]=v;e[tot]=b[tot]=w;nxt[tot]=head[u];head[u]=tot;
ver[++tot]=u;e[tot]=b[tot]=0;nxt[tot]=head[v];head[v]=tot;
}
bool bfs () {
while (!q.empty()) q.pop();
memset(d,0,sizeof(d));
q.push(s); d[s]=1; int x;
while (!q.empty()) {
x=q.front(); q.pop();
for (int i=head[x];i;i=nxt[i])
if (!d[ver[i]]&&e[i]>0) {
d[ver[i]]=d[x]+1;
if (ver[i]==t) return 1;
q.push(ver[i]);
}
}
return 0;
}
double dinic (int x,double f) {
double rest=f;
if (x==t) return f;
for (int i=head[x];i&&rest>0;i=nxt[i])
if (e[i]>0&&d[ver[i]]==d[x]+1) {
double now=dinic(ver[i],min(e[i],rest));
if (fabs(now-0)<0.00001) d[ver[i]]=0;
e[i]-=now;
e[i^1]+=now;
rest-=now;
}
return f-rest;
}
bool check (double mid) {
myflow=0;double tmp=0;
for (int i=2;i<=tot;i++)
e[i]=min(mid,b[i]);
while (bfs())
while (tmp=dinic(s,inf)) myflow+=tmp;
if (fabs(myflow-maxflow)<0.00001) return 1;
return 0;
}
int main () {
int u,v,w;double l,r,mid,tmp=0;
T=1;
while (T--) {
scanf("%d%d%d",&n,&m,&p);
memset(head,0,sizeof(head));
tot=1,maxflow=0;
s=1,t=n;
for (int i=1;i<=m;i++) {
scanf("%d%d%d",&u,&v,&w);
add(u,v,w);
}
while (bfs())
while (tmp=dinic(s,inf)) maxflow+=tmp;
printf("%.0lf\n",maxflow);
l=0,r=maxflow+0.00001;
while (fabs(l-r)>0.00001) {
mid=(l+r)/2;
if (check(mid)) r=mid;
else l=mid;
}
printf("%.5lf\n",(double)l*p);
}
return 0;
}