思路:
- 普通费用流用加减,这里概率是乘除法。
- 取log,可以把乘除变为加减
- 第一次不会破化,可以建一条 (cap=1,cost=0) 的边,另一条边 (cap=c−1,cost=0) ,注意 c>1?
- 用spfa会卡时间,可以用eps精度优化
- 卡时间飘过
代码 :
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3+7;
const int MAXM = 1e5+7;
const int INF = 0x3fff3fff;
const double eps=1e-6;
struct Edge{
int to,next,cap,flow;
double cost;
}edge[MAXM];
int head[MAXN],tol;
int pre[MAXN];
double dis[MAXN];
bool vis[MAXN];
int N;//节点总个数,节点编号从0~N-1
void init(int n){
N=n;
tol=0;
memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int cap,double cost ){
edge[tol].to=v;
edge[tol].cap=cap;
edge[tol].cost=cost;
edge[tol].flow=0;
edge[tol].next=head[u];
head[u]=tol++;
edge[tol].to=u;
edge[tol].cap=0;
edge[tol].cost=-cost;
edge[tol].flow=0;
edge[tol].next=head[v];
head[v]=tol++;
}
bool spfa(int s,int t){
queue<int>q;
for(int i=0;i<N;i++){
dis[i]=INF;
vis[i]=false;
pre[i]=-1;
}
dis[s]=0;
vis[s]=true;
q.push(s);
while(!q.empty()){
int u=q.front();
q.pop();
vis[u]=false;
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].to;
if(edge[i].cap>edge[i].flow &&dis[v]-dis[u]-edge[i].cost>eps){
dis[v]=dis[u]+edge[i].cost;
pre[v]=i;
if(!vis[v]){
vis[v]=true;
q.push(v);
}
}
}
}
if(pre[t]==-1)return false;
else return true;
}
//返回的是最大流,cost存的是最小费用
int minCostMaxflow(int s,int t,double &cost){
int flow=0;
cost=0;
while(spfa(s,t)){
int Min=INF;
//if(dis[t]>=0)break;//不能增广
for(int i=pre[t];i!=-1;i=pre[edge[i^1].to]){
if(Min>edge[i].cap-edge[i].flow){
Min=edge[i].cap-edge[i].flow;
}
}
for(int i=pre[t];i!=-1;i=pre[edge[i^1].to]){
edge[i].flow+=Min;
edge[i^1].flow-=Min;
cost+=edge[i].cost*Min;
}
flow+=Min;
}
return flow;
}
int n,m;
int main()
{
int kase;
cin>>kase;
while(kase--){
cin>>n>>m;
int S=0,T=2*n+1;
init(2*n+2);
for(int i=1;i<=n;i++){
int a,b;
scanf("%d%d",&a,&b);
addedge(S,i,a,0);
addedge(n+i,T,b,0);
addedge(i,n+i,INF,0);
addedge(n+i,i,INF,0);
}
for(int i=1;i<=m;i++){
int a,b,c;
double d;
scanf("%d%d%d%lf",&a,&b,&c,&d);
double p=-log2(1-d);
if(c>0)addedge(a,n+b,1,0);
if(c>1)addedge(a,n+b,c-1,-log2(1-d));
}
double ans=0;
minCostMaxflow(S,T,ans);
ans=pow(2,-ans);
printf("%.2f\n",1.0-ans);
}
return 0;
}