【POJ1984】【二维加权并查集】【向量运算】【四边形法则】
来源:互联网 发布:ios如何清除app数据 编辑:程序博客网 时间:2024/05/22 07:39
Navigation Nightmare
Time Limit: 2000MS Memory Limit: 30000KTotal Submissions: 5065 Accepted: 1898Case Time Limit: 1000MS
Description
Farmer John's pastoral neighborhood has N farms (2 <= N <= 40,000), usually numbered/labeled 1..N. A series of M (1 <= M < 40,000) vertical and horizontal roads each of varying lengths (1 <= length <= 1000) connect the farms. A map of these farms might look something like the illustration below in which farms are labeled F1..F7 for clarity and lengths between connected farms are shown as (n):
Being an ASCII diagram, it is not precisely to scale, of course.
Each farm can connect directly to at most four other farms via roads that lead exactly north, south, east, and/or west. Moreover, farms are only located at the endpoints of roads, and some farm can be found at every endpoint of every road. No two roads cross, and precisely one path
(sequence of roads) links every pair of farms.
FJ lost his paper copy of the farm map and he wants to reconstruct it from backup information on his computer. This data contains lines like the following, one for every road:
There is a road of length 10 running north from Farm #23 to Farm #17
There is a road of length 7 running east from Farm #1 to Farm #17
...
As FJ is retrieving this data, he is occasionally interrupted by questions such as the following that he receives from his navigationally-challenged neighbor, farmer Bob:
What is the Manhattan distance between farms #1 and #23?
FJ answers Bob, when he can (sometimes he doesn't yet have enough data yet). In the example above, the answer would be 17, since Bob wants to know the "Manhattan" distance between the pair of farms.
The Manhattan distance between two points (x1,y1) and (x2,y2) is just |x1-x2| + |y1-y2| (which is the distance a taxicab in a large city must travel over city streets in a perfect grid to connect two x,y points).
When Bob asks about a particular pair of farms, FJ might not yet have enough information to deduce the distance between them; in this case, FJ apologizes profusely and replies with "-1".
F1 --- (13) ---- F6 --- (9) ----- F3 | | (3) | | (7) F4 --- (20) -------- F2 | | | (2) F5 | F7
Being an ASCII diagram, it is not precisely to scale, of course.
Each farm can connect directly to at most four other farms via roads that lead exactly north, south, east, and/or west. Moreover, farms are only located at the endpoints of roads, and some farm can be found at every endpoint of every road. No two roads cross, and precisely one path
(sequence of roads) links every pair of farms.
FJ lost his paper copy of the farm map and he wants to reconstruct it from backup information on his computer. This data contains lines like the following, one for every road:
There is a road of length 10 running north from Farm #23 to Farm #17
There is a road of length 7 running east from Farm #1 to Farm #17
...
As FJ is retrieving this data, he is occasionally interrupted by questions such as the following that he receives from his navigationally-challenged neighbor, farmer Bob:
What is the Manhattan distance between farms #1 and #23?
FJ answers Bob, when he can (sometimes he doesn't yet have enough data yet). In the example above, the answer would be 17, since Bob wants to know the "Manhattan" distance between the pair of farms.
The Manhattan distance between two points (x1,y1) and (x2,y2) is just |x1-x2| + |y1-y2| (which is the distance a taxicab in a large city must travel over city streets in a perfect grid to connect two x,y points).
When Bob asks about a particular pair of farms, FJ might not yet have enough information to deduce the distance between them; in this case, FJ apologizes profusely and replies with "-1".
Input
* Line 1: Two space-separated integers: N and M* Lines 2..M+1: Each line contains four space-separated entities, F1, F2, L, and D that describe a road. F1 and F2 are numbers of two farms connected by a road, L is its length, and D is a character that is either 'N', 'E', 'S', or 'W' giving the direction of the road from F1 to F2.* Line M+2: A single integer, K (1 <= K <= 10,000), the number of FB's queries* Lines M+3..M+K+2: Each line corresponds to a query from Farmer Bob and contains three space-separated integers: F1, F2, and I. F1 and F2 are numbers of the two farms in the query and I is the index (1 <= I <= M) in the data after which Bob asks the query. Data index 1 is on line 2 of the input data, and so on.
Output
* Lines 1..K: One integer per line, the response to each of Bob's queries. Each line should contain either a distance measurement or -1, if it is impossible to determine the appropriate distance.
Sample Input
7 61 6 13 E6 3 9 E3 5 7 S4 1 3 N2 4 20 W4 7 2 S31 6 11 4 32 6 6
Sample Output
13-110
Hint
At time 1, FJ knows the distance between 1 and 6 is 13.
At time 3, the distance between 1 and 4 is still unknown.
At the end, location 6 is 3 units west and 7 north of 2, so the distance is 10.
At time 3, the distance between 1 and 4 is still unknown.
At the end, location 6 is 3 units west and 7 north of 2, so the distance is 10.
Source
USACO 2004 February
[Submit] [Go Back] [Status] [Discuss]
#include <iostream>#include <cstring>#include <cmath>#include <queue>#include <stack>#include <list>#include <map>#include <set>#include <string>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std;#define rep(i,a,n) for (int i=a;i<n;i++)#define per(i,a,n) for (int i=n-1;i>=a;i--)#define mp push_backint n,m;struct Enode{int x,y,dis;char dir;}enode[40010];struct Qnode{int x,y,time;int id;}qnode[10010];struct Fnode{int idx,x,y;}F[40010];int ret[10010];int cmp(const Qnode&a,const Qnode &b) {return a.time < b.time;}int Find(int x){if(F[x].idx == -1) return x;int t = Find(F[x].idx);F[x].x += F[F[x].idx].x;F[x].y += F[F[x].idx].y;return F[x].idx = t;}void merge(Enode n){int x = n.x;int y = n.y;int dis = n.dis;char dir = n.dir;int fx = Find(x);int fy = Find(y);F[fx].idx = fy;if(dir == 'E'){F[fx].x = -F[x].x + dis + F[y].x;F[fx].y = -F[x].y + F[y].y;}else if(dir == 'W'){F[fx].x = -F[x].x - dis + F[y].x;F[fx].y = -F[x].y + F[y].y;}else if(dir == 'N'){F[fx].x = -F[x].x + F[y].x;F[fx].y = -F[x].y + F[y].y + dis;}else{F[fx].x = -F[x].x + F[y].x;F[fx].y = -F[x].y + F[y].y - dis;}}int main(){while(scanf("%d%d",&n,&m) != EOF){for(int i=1;i<=n;i++){F[i].idx = -1;}for(int i=1;i<=m;i++){cin >> enode[i].x >> enode[i].y >> enode[i].dis >> enode[i].dir;}int q;scanf("%d",&q);for(int i=1;i<=q;i++){cin >> qnode[i].x >> qnode[i].y >> qnode[i].time;qnode[i].id = i;}sort(qnode+1,qnode+q+1,cmp);int cur = 1;for(int i=1;i<=q;i++){while(cur <= qnode[i].time) merge(enode[cur++]);Qnode node = qnode[i];int t1 = Find(node.x);int t2 = Find(node.y);if(t1 != t2){ret[qnode[i].id] = -1;}else{ret[qnode[i].id] = abs(F[node.x].x - F[node.y].x) + abs(F[node.x].y - F[node.y].y);}}for(int i=1;i<=q;i++){printf("%d\n",ret[i]);}}while(1);return 0;}
0 0
- 【POJ1984】【二维加权并查集】【向量运算】【四边形法则】
- poj1984(并查集)
- 并查集(查找优化——加权法则)
- poj1984并查集的相对偏移
- poj1984 带权并查集
- 并查集经典题之POJ1984
- poj1984 Navigation Nightmare(并查集)
- POJ1984 Navigation Nightmare(并查集)
- poj1984 Navigation Nightmare(带权并查集)
- kungbin专题五 并查集 POJ1984 Navigation Nightmare
- UVA11987(加权并查集)
- 【HDU3038】【加权并查集】
- HDU2818加权并查集
- 便 加权并查集
- UVA alive 4487 Exclusive-OR(加权并查集+异或运算的理解)
- hdu3038(加权并查集)
- uva12232 - Exclusive-OR 加权并查集
- SD五一联赛(加权并查集)
- Ethernet frame check sequence incorrect
- POJ 3041--Asteroids【二分图 && 最小点数覆盖】
- iOS使用极光推动的实现
- Adt-Bundle v22.3.0升级到v23.0.7时出错
- 位运算:位逻辑运算和位移运算——可以节省内存
- 【POJ1984】【二维加权并查集】【向量运算】【四边形法则】
- hpu 1206 Diamond <这道题有坑>
- 从Ashley Madison泄露3300万用户数据分析用户构成
- Java连接MySQL与基本SQL语句
- POJ 1305-Fermat vs. Pythagoras(毕达哥拉斯三元组的解)
- iOS Storyboard unwind segues使用小结
- Markdown编辑数学公式:Haroopad + MathJax
- 数据结构学习之路-第二章:线性单链表
- UIImagePickerController详解