BZOJ 1486: [HNOI2009]最小圈 01分数规划 dfs_spfa判负环

1486: [HNOI2009]最小圈

Time Limit: 10 Sec  Memory Limit: 64 MB
Submit: 2459  Solved: 1169
[Submit][Status][Discuss]

Description

 

Input

Output

Sample Input

4 5
1 2 5
2 3 5
3 1 5
2 4 3
4 1 3

Sample Output

3.66666667

01分数规划 dfs_spfa判负环

二分答案 暴力搞

#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<map>
#include<set>
using namespace std;

typedef double db;

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x*f;
}
void print(int x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}

const int N=50100,M=100100,inf=0X3f3f3f3f;
const db eps=1e-10;

int ecnt,last[N];
struct EDGE{int to,nt;db val;}e[M];
inline void add(int u,int v,db val)
{e[++ecnt]=(EDGE){v,last[u],val};last[u]=ecnt;}

db VAL[M],dis[N];

int n,m,U[M],V[M];

bool vis[N],flag;

void build(db x)
{
	memset(last,0,sizeof(last));ecnt=0;
	for(int i=1;i<=m;++i){add(U[i],V[i],VAL[i]-x);}
}

void spfa(int u)
{
	vis[u]=1;
	register int i;
	for(i=last[u];i;i=e[i].nt)
	if(dis[e[i].to]>dis[u]+e[i].val)
	{
		if(vis[e[i].to]){flag=1;break;}
		dis[e[i].to]=dis[u]+e[i].val;
		spfa(e[i].to);
	}
	vis[u]=0;
}

bool judge(db x)
{
	build(x);
	memset(dis,0,sizeof(dis));memset(vis,0,sizeof(vis));
	register int i;flag=0;
	for(i=1;i<=n;++i){spfa(i);if(flag)return 1;}
	return 0;
}

int main()
{
	n=read();m=read();
	register int i;
	for(i=1;i<=m;++i){U[i]=read();V[i]=read();scanf("%lf",&VAL[i]);}
	db l=-10000000,r=10000000,mid;
	while(abs(r-l)>eps)
	{
		mid=(l+r)/2;
		judge(mid)?r=mid:l=mid;
	}
	printf("%.8lf\n",l);return 0;
}
/*
4 5
1 2 5
2 3 5
3 1 5
2 4 3
4 1 3

3.66666667
*/