题目大意:
求出最小的redundancy ratio,redundancy ratio也就是从A点到B点一个小时能通过的最大车流量 / 所通过的路径的某一条路径的车流量;
代码实现:
SAP:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#define Max(a,b) ((a)>(b)?(a):(b))
using namespace std;
const int N=1010;
const int M=1000010;
const int INF=0x3f3f3f3f;
int n,m,s,t,top,head[N],gap[N],cur[N],pre[N],dis[N],maxflow;
struct Edge{
int to,next,flow;
}edge[M*2];
void Addedge(int from,int to,int flow){
edge[top].to=to,edge[top].next=head[from],edge[top].flow=flow,head[from]=top++;
edge[top].to=from,edge[top].next=head[to],edge[top].flow=0,head[to]=top++;
}
void Bfs(){
queue<int> q;
memset(gap,0,sizeof(gap));
memset(dis,-1,sizeof(dis));
gap[0]=1,dis[t]=0;
q.push(t);
while(!q.empty()){
int u=q.front();
q.pop();
for(int i=head[u];i+1;i=edge[i].next){
if(dis[edge[i].to]==-1){
dis[edge[i].to]=dis[u]+1;
gap[dis[edge[i].to]]++;
q.push(edge[i].to);
}
}
}
}
int Sap(){
Bfs();
memset(pre,-1,sizeof(pre));
for(int i=0;i<n;++i) cur[i]=head[i];
int u=s,cur_flow,max_flow=0,neck,tmp;
while(dis[s]<=t){
if(u==t){
cur_flow=INF;
for(int i=s;i!=t;i=edge[cur[i]].to){
if(cur_flow>edge[cur[i]].flow){
neck=i;
cur_flow=edge[cur[i]].flow;
}
}
maxflow=Max(maxflow,cur_flow);
for(int i=s;i!=t;i=edge[cur[i]].to){
tmp=cur[i];
edge[tmp].flow-=cur_flow;
edge[tmp^1].flow+=cur_flow;
}
max_flow+=cur_flow;
u=neck;
}
int i;
for(i=cur[u];i!=-1;i=edge[i].next)
if(edge[i].flow&&dis[u]==dis[edge[i].to]+1) break;
if(i!=-1){
cur[u]=i;
pre[edge[i].to]=u;
u=edge[i].to;
}else{
if(--gap[dis[u]]==0) break;
cur[u]=head[u];
int mindis=n;
for(i=head[u];i+1;i=edge[i].next)
if(edge[i].flow&&mindis>dis[edge[i].to])
mindis=dis[edge[i].to];
dis[u]=mindis+1;
gap[dis[u]]++;
if(u!=s) u=pre[u];
}
}
return max_flow;
}
int main(){
int p,d,u,v,val;
scanf("%d",&p);
while(p--){
memset(head,-1,sizeof(head));
top=maxflow=0;
scanf("%d%d%d%d%d",&d,&n,&m,&s,&t);
for(int i=0;i<m;++i){
scanf("%d%d%d",&u,&v,&val);
Addedge(u,v,val);
}
int res=Sap();
printf("%d %.3lf\n",d,(res*1.0)/(maxflow*1.0));
}
}
Dinic:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
using namespace std;
const int N=1010;
const int M=1000010;
const int INF=0x3f3f3f3f;
int n,m,s,t,top,head[N],dis[N],maxflow;
struct Edge{
int to,next,flow;
}edge[M*2];
void Addedge(int from,int to,int flow){
edge[top].to=to,edge[top].next=head[from],edge[top].flow=flow,head[from]=top++;
edge[top].to=from,edge[top].next=head[to],edge[top].flow=0,head[to]=top++;
}
int Bfs(){
queue<int> q;
memset(dis,-1,sizeof(dis));
dis[s]=0;
q.push(s);
while(!q.empty()){
int u=q.front();
if(u==t) return 1;
q.pop();
for(int i=head[u];i+1;i=edge[i].next){
if(dis[edge[i].to]==-1&&edge[i].flow){
dis[edge[i].to]=dis[u]+1;
q.push(edge[i].to);
}
}
}
return 0;
}
int Dinic(int u,int sum){
if(u==t){
maxflow=Max(maxflow,sum);
return sum;
}
int max_flow=0;
for(int i=head[u];i+1;i=edge[i].next){
if(dis[edge[i].to]==dis[u]+1&&edge[i].flow){
int a=Dinic(edge[i].to,Min(sum-max_flow,edge[i].flow));
edge[i].flow-=a;
edge[i^1].flow+=a;
max_flow+=a;
if(max_flow==sum) return max_flow;
}
}
if(!max_flow) dis[u]=-1;
return max_flow;
}
int main(){
int p,d,u,v,val;
scanf("%d",&p);
while(p--){
memset(head,-1,sizeof(head));
top=maxflow=0;
scanf("%d%d%d%d%d",&d,&n,&m,&s,&t);
for(int i=0;i<m;++i){
scanf("%d%d%d",&u,&v,&val);
Addedge(u,v,val);
}
int res=0,a;
while(Bfs()){
res+=Dinic(s,INF);
}
printf("%d %.3lf\n",d,(res*1.0)/(maxflow*1.0));
}
}