[dfs] BZOJ 4602 [Sdoi2016]齿轮

好水 乘除换成log

但是据说long double 过了？

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#define cl(x) memset(x,0,sizeof(x))
using namespace std;
 
inline char nc()
{
    static char buf[100000],*p1=buf,*p2=buf;
    if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
    return *p1++;
}
 
inline void read(int &x)
{
    char c=nc(),b=1;
    for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
    for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
 
const int M=10005,N=1005;
 
struct edge{
    int u,v,a,b,f,next;
}G[M<<1];
int head[N],inum;
 
inline void add(int u,int v,int a,int b,int f,int p){
    G[p].u=u; G[p].v=v; G[p].a=a; G[p].b=b; G[p].f=f; G[p].next=head[u]; head[u]=p;
}
 
int n,m;
int flag;
int vst[N],tag[N];
double sum[N];
 
#define V G[p].v
void dfs(int u,int fa,double d,int f)
{
    if (flag) return;
    sum[u]=d; tag[u]=f; vst[u]=1;
    for (int p=head[u];p;p=G[p].next)
        if (V!=fa)
        {
            if (!vst[V])
                dfs(V,u,d+log(G[p].b)-log(G[p].a),f^G[p].f);
            else
            {
                if (tag[u]^G[p].f!=tag[V] || fabs(sum[u]+log(G[p].b)-log(G[p].a)-sum[V])>1e-5)
                   flag=1;
            }       
        }
} 
 
int main()
{
    int Q,iu,iv,ia,ib;
    read(Q);
    for (int t=1;t<=Q;t++)
    {
        cl(head); inum=0; cl(vst);
        read(n); read(m);
        for (int i=1;i<=m;i++)
        {
            read(iu); read(iv); read(ia); read(ib);
            if (ib>0)
                add(iu,iv,ia,ib,0,++inum),add(iv,iu,ib,ia,0,++inum); 
            else
                add(iu,iv,ia,-ib,1,++inum),add(iv,iu,-ib,ia,1,++inum);
        }
        flag=0;
        for (int i=1;i<=n;i++)
            if (!vst[i])
                dfs(i,0,0,1);
        printf("Case #%d: ",t);                 
        if (flag)
            printf("No\n");
        else
            printf("Yes\n");
    }
    return 0;
}