传送门
本来很好办的一道题(二分答案+SPFA判负环),足足弄了两个多小时,差点把键盘吃了。
1.judge函数传的参数是double类型不是int类型,调了50min
2.dis[]是double类型,又调了25min
实际上代码就写了十多分钟QAQ。。。
还是要注意一下:
1.SPFA一开始所以点入队,因为图的连通性不确定。
2.DOUBLE!DOUBLE!DOUBLE!!!!!!!!!!!!!!!!!!!!!!!!!!!
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<climits>
#include<cstdlib>
#include<queue>
using namespace std;
const int maxn=52;
int n,m;
double dis[maxn];//25min
int vis[maxn],in[maxn];
int head[maxn],edge=0;
struct EDGE {
int v,nxt;
double w;
}e[maxn*maxn];
inline int read() {
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
inline void adde(int u,int v,double w) {
e[edge].v=v,e[edge].nxt=head[u],e[edge].w=w,head[u]=edge++;
}
inline void init() {
memset(head,-1,sizeof(head)),
edge=0;
}
inline bool SPFA() {
queue<int> q;
for (int i=1;i<=n;++i)
in[i]=dis[i]=0,vis[i]=1,q.push(i);
while (!q.empty()) {
int p=q.front();
q.pop(),vis[p]=0;
for (int i=head[p];~i;i=e[i].nxt) {
int v=e[i].v;
if (dis[v]>dis[p]+e[i].w) {
dis[v]=dis[p]+e[i].w;
if (!vis[v]) {
q.push(v),vis[v]=1;
if (++in[v]>=n) return true;
}
}
}
}
return false;
}
inline bool judge(double x) {//50min
for (int i=0;i<edge;++i) e[i].w-=x;
bool f=SPFA();
for (int i=0;i<edge;++i) e[i].w+=x;
return f;
}
int main() {
// freopen("UVa 11090.in","r",stdin);
int kase=read();
for (int r=1;r<=kase;++r) {
init();
n=read(),m=read();
double L=INT_MAX,R=0;
while (m--) {
int u=read(),v=read();
double w;scanf("%lf",&w);
adde(u,v,w);
L=min(L,w),R=max(w,R);
}
printf("Case #%d: ",r);
if (!judge(R+1)) {printf("No cycle found.\n");continue;}
while (R-L>1e-3) {
double mid=L+(R-L)/2;
if (judge(mid)) R=mid;
else L=mid;
}
printf("%.2lf\n",R);
}
return 0;
}