记一次考试(GT Practice #1)

t1,t2 SB题,t3虽然是费用流,但是我不会写,于是就写了一个贪心dinic(神TM)结果比大佬的分还多。。。

PS:eps=1e-5,1e-8都可以过,eps=1e-6,1e-7不能过...感到畏惧

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#define maxn 2100
#define maxm 550000
#define yjq 2047
using namespace std;
typedef double ldb;
const ldb eps=1e-5;
struct edge{
    int r,nxt,w,bh;ldb cost;
}e[maxm];
struct data{
	int u,v,c;ldb w;
	void scan(){
		double _w;
		scanf("%d%d%d%lf",&u,&v,&c,&_w);
		w=log(1-_w);
	}
}d[maxm];
ldb ans=0,dp[maxn],cost;
bool vis[maxn];
int cur[maxn],dep[maxn],head[maxn],S,T,esz=2,n,m,q[maxn],l,r;
void addedge(int u,int v,int w,ldb cost){
    e[esz].r=v;e[esz].nxt=head[u];e[esz].w=w;e[esz].cost=cost;head[u]=esz++;
    e[esz].r=u;e[esz].nxt=head[v];e[esz].w=0;e[esz].cost=-cost;head[v]=esz++;
}
int dcmp(ldb a){
	return fabs(a)<eps?0:(a<0?-1:1);
}
bool spfa(){
	for(int i=S;i<=T;++i)dp[i]=1e20;
    q[r=1,l=0]=S,dp[S]=0;
    bool flag=false;
    while(l!=r){
        int u=q[l++];l&=yjq;
//        printf("[%d]",u);
		vis[u]=false;
        if(u==T)flag=true;
        for(int t=head[u];t;t=e[t].nxt)if(e[t].w&&dcmp(dp[e[t].r]-(dp[u]+e[t].cost))>0){
//        	printf("<%.3lf>\n",dp[e[t].r]);
        	dp[e[t].r]=dp[u]+e[t].cost;
			if(!vis[e[t].r])q[r++]=e[t].r,r&=yjq,vis[e[t].r]=true;
		}
    }
    return flag;
}
int find(int u,int f){
//	printf("[%d]",u);
	cur[u]=true;
    if(u==T)return f;
    int used=0,a=0;
    for(int t=head[u];t;t=e[t].nxt)if(!cur[e[t].r]&&e[t].w&&dcmp(dp[e[t].r]-(dp[u]+e[t].cost))==0){
        int a=find(e[t].r,min(e[t].w,f-used));
		e[t].w-=a,e[t^1].w+=a,used+=a;cost+=a*e[t].cost;
        if(used==f)return used;
    }
    return used;
}
int dinic(){
    int ans=0,a;
    while(spfa()){
    	cur[T]=1;
    	while(cur[T]){
    		memset(cur,0,sizeof(cur));
    		ans+=find(S,1<<30);
		}
    }
    return ans;
}
int main(){
	scanf("%d%d",&n,&m);
	S=0,T=n+1;
	int p=0;
	for(int i=1,s,b;i<=n;++i){
		scanf("%d%d",&s,&b);
		if(s>b)addedge(S,i,s-b,0),p+=s-b;
		else addedge(i,T,b-s,0);
	}
	for(int i=1;i<=m;++i){
		d[i].scan();
		addedge(d[i].u,d[i].v,1,0);
		addedge(d[i].u,d[i].v,d[i].c-1,-d[i].w);
	}
	if(dinic()!=p)printf("1.00");
	else printf("%.2lf",1-exp(-cost));
}