POJ 1984 Navigation Nightmare（带权并查集）

POJ 1984 Navigation Nightmare（带权并查集）

vj链接

Solution

乍一看似乎不太好求曼哈顿距离，但是思考后可以发现，只需要维护上下和左右两个方向的距离，计算时将两个的绝对值相加即为曼哈顿距离。

代码

#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
//#define int long long
//sss
#define lowbit(x) ((x) & (-x))
using namespace std;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef pair<double, int> pdi;
typedef double dd;
typedef long long ll;
const int MAXN = 40010;
const int MAXM = 10010;
const dd eps = 1e-6;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3f;

struct TY{
	int f1, f2, w;
	char ch;
} a[MAXN];
struct TY2{
	int f1, f2, id;
} q[MAXM];
int n, m, fa[MAXN];
pii dis[MAXN];
bool cp(TY2 X,TY2 Y){
	return X.id < Y.id;
}

int fd(int x)
{
	if(x==fa[x])
		return x;
	int fx = fd(fa[x]);
	dis[x].first += dis[fa[x]].first, dis[x].second += dis[fa[x]].second;
	fa[x] = fx;
	return fa[x];
}

void un(int x, int y, int w, int id)
{
	int fx = fd(x), fy = fd(y);
	if(fx == fy)
		return;
	fa[fy] = fx;
	if(id == 1)
		dis[fy].first = w - dis[y].first + dis[x].first, dis[fy].second = dis[x].second - dis[y].second;
	else
		dis[fy].second = w - dis[y].second + dis[x].second, dis[fy].first = dis[x].first - dis[y].first;
}
int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n;i++)
		fa[i] = i;
	for (int i = 1; i <= m; i++)
		cin >> a[i].f1 >> a[i].f2 >> a[i].w >> a[i].ch;
	int k;
	cin >> k;
	for (int i = 1; i <= k; i++)
		cin >> q[i].f1 >> q[i].f2 >> q[i].id;
	sort(q + 1, q + 1 + k, cp);
	int now = 1;
	for (int i = 1; i <= k;i++)
	{
		while (now <= q[i].id && now <= m)
		{
			int id = 1;
			if(a[now].ch == 'S')
				a[now].w *= -1;
			else if(a[now].ch == 'W')
				id = 2, a[now].w *= -1;
			else if(a[now].ch == 'E')
				id = 2;
			un(a[now].f1, a[now].f2, a[now].w, id);
			now++;
		}
		int f1 = q[i].f1, f2 = q[i].f2;
		if(fd(q[i].f1) != fd(q[i].f2))
			printf("-1\n");
		else
			printf("%d\n", abs(dis[f2].first - dis[f1].first) + abs(dis[f2].second - dis[f1].second));
	}
}

PS：
更新距离时只更新一个方向的距离导致wa了好几发。。