POJ 1984 带权并查集

题意

传送门 POJ 1984

题解

路径组成一棵树，带权并查集维护连通性以及节点相对根节点的 $x,y$ 轴偏移值。若查询时节点不连通，则无法求解；反之，输出相对距离即可。

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 40005
int N, M, K, F1[maxn], F2[maxn], L[maxn];
char D[maxn];
int par[maxn], rnk[maxn], X[maxn], Y[maxn];

void init(int n)
{
    for (int i = 1; i <= n; i++)
    {
        par[i] = i, rnk[i] = X[i] = Y[i] = 0;
    }
}

int find(int x)
{
    if (par[x] != x)
    {
        int p = par[x];
        par[x] = find(par[x]);
        X[x] += X[p], Y[x] += Y[p];
    }
    return par[x];
}

bool same(int x, int y)
{
    return find(x) == find(y);
}

void unite(int t)
{
    int x = find(F1[t]), y = find(F2[t]);
    if (x == y)
        return;
    int dx = 0, dy = 0;
    switch (D[t])
    {
    case 'N':
        dy = -L[t];
        break;
    case 'S':
        dy = L[t];
        break;
    case 'E':
        dx = -L[t];
        break;
    case 'W':
        dx = L[t];
        break;
    }
    if (rnk[x] > rnk[y])
    {
        par[y] = x, X[y] = X[F1[t]] - dx - X[F2[t]], Y[y] = Y[F1[t]] - dy - Y[F2[t]];
    }
    else
    {
        par[x] = y, X[x] = X[F2[t]] + dx - X[F1[t]], Y[x] = Y[F2[t]] + dy - Y[F1[t]];
        if (rnk[x] == rnk[y])
            ++rnk[y];
    }
}

int main()
{
    scanf("%d%d", &N, &M);
    for (int i = 1; i <= M; i++)
    {
        scanf("%d%d%d %c", F1 + i, F2 + i, L + i, D + i);
    }
    scanf("%d", &K);
    int now = 0;
    init(M);
    for (int i = 0; i < K; i++)
    {
        int u, v, t;
        scanf("%d%d%d", &u, &v, &t);
        while (now <= t)
        {
            unite(now);
            ++now;
        }
        printf("%d\n", same(u, v) ? abs(X[u] - X[v]) + abs(Y[u] - Y[v]) : -1);
    }
    return 0;
}