1701. Ostap and Partners（带权值并查集）

有n个人。其中0的工资是0，有m句话，问最先出现假话的是那句。

但一个集合跟0号所在的集合合并的时候需要判断这个集合的最小值是否小于0，如果小于0，则这句话就是假话。

code：

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <string>

#define LL long long
#define DB double
#define SI(a) scanf("%d",&a)
#define SD(a) scanf("%lf",&a)
#define SS(a) scanf("%s",a)
#define SF scanf
#define PF printf
#define MM(a,v) memset(a,v,sizeof(a))
#define REP(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define REPD(i,a,b) for(int (i)=(a);(i)>(b);(i)--)
#define N 50009
#define INF 0x3f3f3f3f
#define EPS 1e-8
#define bug puts("bug")
using namespace std;
int fa[N],sum[N],Mi[N];

int finfa(int k)
{
    if(fa[k]==k) return k;
    int t = fa[k];
    fa[k] = finfa(fa[k]);
    if(fa[k]!=t)
    {
        sum[k] = sum[t] + sum[k];
    }
    return fa[k];
}
void ini()
{
    REP(i,0,N) sum[i] = 0,fa[i] = i;
}
int n,m;

void un(int a,int b,int c)
{
    int x =finfa(a),y = finfa(b);
    if(x>y)
    {
        sum[x] = c+(sum[x]-sum[a])-(sum[y]-sum[b]);
        fa[x] = y;
        Mi[y] = min(Mi[y],sum[x]+Mi[x]);
    }else
    {
        sum[y] = -(c-(sum[y]-sum[b])+(sum[x]-sum[a]));
        fa[y] = x;
        Mi[x] = min(Mi[x],sum[y]+Mi[y]);
    }
}
void out()
{
    REP(i,0,n)
    {
        finfa(i);
        cout<<sum[i]<<" ";
    }cout<<endl;
}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    ini();
    SI(n);SI(m);
    int flag = -1;
    int a,b,c;
    REP(i,0,m)
    {
        SI(a);SI(b);SI(c);
        if(flag!=-1) continue;
        if(finfa(a)!=finfa(b))
        {
            un(a,b,c);
            if(finfa(a)==0&&Mi[0]<0) flag = i+1;
        }else
        {
            finfa(a);finfa(b);
            if(sum[a]-sum[b]!=c&&flag==-1)
            {
                flag = i+1;
            }
        }
    }
    int mi = 0;
    REP(i,0,n)
    {
        finfa(i);
        mi = min(mi,sum[i]);
    }
    if(flag==-1)
    {
        PF("Possible\n");
        REP(i,0,n)
        {
            int t = finfa(i);
            if(t==0)
            PF("%d\n",sum[i]);
            else
            PF("%d\n",sum[i]-mi);
        }
    }else
    {
        PF("Impossible after %d statements\n",flag);
    }
    return 0;
}