How Many Answers Are Wrong(hdu3038带权并查集)

题意：给你一些区间的和，错误的有多少个。

思路：带权并查集

点a到点b的距离等于b到根的距离-a到根的距离

其他同3047一样

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct bian
{
    int father;
    int dis;
}p[200005];
int flag = 0;
void Make_set(int n)
{
    int i;
    for(i = 0; i <= n; i++)
    {
        p[i].father = i;
        p[i].dis = 0;
    }
}

int Find_set(int x)
{
    if(x != p[x].father)
    {
        int temp = p[x].father;
        p[x].father = Find_set(p[x].father);
        p[x].dis += p[temp].dis;
    }
    return p[x].father;
}

void Union(int a,int b,int d)
{
    int x = Find_set(a);
    int y = Find_set(b);

    if(x == y)
    {
        if(p[b].dis-p[a].dis != d)
        {
            flag = 1;
            return ;
        }
    }
    else
    {
        p[y].father = x;
        p[y].dis = (p[a].dis+d-p[b].dis);
    }
}
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m) !=EOF)
    {
        int i,sum = 0;
        Make_set(n);
        for(i = 0; i < m; i++)
        {
            int a,b,d;
            flag = 0;
            scanf("%d%d%d",&a,&b,&d);
            Union(--a,b,d);
            if(flag)
                sum++;
        }
        printf("%d\n",sum);
    }
    return 0;
}