题意难理解。
就是有这么一个东西叫redundancy ratio,计算方法为:最大流/从起点到源点的某一条路的最小流量。现在要求最小的redundancy ratio,所以也就是要分母最大。即求 max{所有路里每条路中最小的权}
以下程序过不了下面的数据
4
1 6 7 0 5
0 1 4
1 4 4
4 5 4
0 2 3
2 5 3
0 3 3
3 5 3
2 6 6 0 5
0 1 5
1 2 5
2 3 5
3 4 4
4 5 5
0 4 2
3 6 6 0 5
0 1 70
1 2 40
2 4 40
1 3 20
3 4 20
4 5 50
4 7 8 1 5
1 2 5
2 3 2
3 5 2
2 4 3
4 5 3
2 6 5
6 7 5
7 5 5
答案:
2.500
1.250
1.250
1.000
#include <string.h>
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define CLR( a , x ) memset ( a , x , sizeof (a) );
#define RE freopen("1.in","r",stdin);
#define WE freopen("1.out","w",stdout);
#define debug(x) cout<<#x<<":"<<(x)<<endl;
const int maxm=1005;
const int maxn=1020;
const int inf = 0x3f3f3f3f;
struct Edge
{
int v,w,next;
}edge[maxm*2];
int head[maxn],dis[maxn];
int tol;
void addEdge(int u,int v,int w)
{
edge[tol].v=v,edge[tol].w=w,edge[tol].next=head[u];head[u]=tol++;
edge[tol].v=u,edge[tol].w=0,edge[tol].next=head[v];head[v]=tol++;
}
void init()
{
tol=0;
CLR(head,-1);
}
bool bfs(int s,int t)
{
queue<int>q;
q.push(s);
CLR(dis,-1);
dis[s]=0;
while(!q.empty())
{
int u=q.front();q.pop();
for(int i=head[u];i!=-1;i=edge[i].next)
{
int v=edge[i].v;
if( dis[v]<0 && edge[i].w)
{
dis[v]=dis[u]+1;
q.push(v);
}
}
}
return dis[t]!=-1;
}
int tmax;
int dfs(int s,int t,int low)
{
int flow;
if(t==s) return low;
for(int i=head[s];i!=-1;i=edge[i].next)
{
int v=edge[i].v;
if(edge[i].w && (dis[v]==dis[s]+1) &&
(flow = dfs(v,t,min(low,edge[i].w))))
{
edge[i].w -= flow;
edge[i^1].w += flow;
tmax=max(tmax,flow); //~
return flow;
}
}
return 0;
}
int maxFlow(int s,int t)
{
int ans=0,tmp;
while(bfs(s,t)){
while(tmp=dfs(s,t,inf))
ans+=tmp;
}
return ans;
}
int main()
{
int ca,m,n,a,b,c,ss,tt,te;
// RE WE
scanf("%d",&ca);
for(int ted=1;ted<=ca;ted++)
{
scanf("%d%d%d%d%d",&te,&n,&m,&ss,&tt);
init();
tmax=-1;
while(m--)
{
scanf("%d%d%d",&a,&b,&c);
addEdge(a,b,c);
}
printf("%d %.3f\n",te,1.0*maxFlow(ss,tt)/tmax);
}
return 0;
}