【并查集】POJ_1984_Navigation Nightmare
来源:互联网 发布:今日大宗交易数据 编辑:程序博客网 时间:2024/06/11 18:06
Navigation Nightmare
Time Limit: 2000MS Memory Limit: 30000KTotal Submissions: 7036 Accepted: 2521Case 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
#include <cstdio>#include <cstring>//#include <bits/stdc++.h>using namespace std;const int maxn=40010;int n,m,w,xx[maxn],yy[maxn],f[maxn];struct node { int u,v,dx,dy;}p[maxn];int abs(int x,int y){ return x>y?x-y:y-x;}void Init(){ for(int i=0;i<=n;i++){ f[i]=i; xx[i]=0; yy[i]=0; }}int Find(int x){ if(f[x]!=x){ int temp=Find(f[x]); xx[x]+=xx[f[x]]; yy[x]+=yy[f[x]]; f[x]=temp; } return f[x];}void Union(int x,int y,int dx,int dy){ int fx=Find(x); int fy=Find(y); if(fx!=fy){ f[fy]=fx; xx[fy]=dx-xx[y]+xx[x]; yy[fy]=dy-yy[y]+yy[x]; }}int main(){ char s[5]; scanf("%d%d",&n,&m); Init(); for(int i=0;i<m;i++){ scanf("%d%d%d%s",&p[i].u,&p[i].v,&w,s); switch (s[0]){ case 'W':p[i].dx=-w;p[i].dy=0;break; case 'E':p[i].dx=w;p[i].dy=0;break; case 'N':p[i].dx=0;p[i].dy=w;break; case 'S':p[i].dx=0;p[i].dy=-w;break; } } int q,u,v,idx,now=0; scanf("%d",&q); while(q--){ scanf("%d%d%d",&u,&v,&idx); for(;now<idx;now++){ Union(p[now].u,p[now].v,p[now].dx,p[now].dy); } int fx=Find(u); int fy=Find(v); //printf("%d %d\n",fx,fy); if(fx!=fy){ printf("-1\n"); } else { printf("%d\n",abs(xx[u],xx[v])+abs(yy[u],yy[v])); } } return 0;}
阅读全文
0 0
- 【并查集】POJ_1984_Navigation Nightmare
- 【POJ 1984】Navigation Nightmare (并查集)
- POJ--1984-Navigation Nightmare--并查集
- poj 1984 - Navigation Nightmare(并查集)
- poj1984 Navigation Nightmare(并查集)
- POJ 1984 Navigation Nightmare 并查集
- POJ1984 Navigation Nightmare(并查集)
- PKU 1984 Navigation Nightmare dfs+并查集
- POJ 1984 Navigation Nightmare【并查集思路总结】
- poj 1984 Navigation Nightmare(带权并查集)
- POJ 1984 Navigation Nightmare(路径压缩并查集)
- 【POJ】1984 Navigation Nightmare 带权并查集
- POJ 1984 Navigation Nightmare 二维带权并查集
- POJ 1984 Navigation Nightmare (数据结构-并查集)
- BZOJ 3362 Navigation Nightmare 带权并查集
- POJ 1984 Navigation Nightmare (离线并查集)
- POJ 1984 Navigation Nightmare(加权并查集)
- poj 1984 Navigation Nightmare 并查集 解题报告
- 如何使用CSS隐藏滚动条并且兼容大部分浏览器
- python入门(二十七):面向对象之封装
- Gym
- Decision Tree
- 完全卸载oracle11g步骤
- 【并查集】POJ_1984_Navigation Nightmare
- .Net下的Windows服务程序开发指南
- Codeforces Round #429 (Div. 2) 题解
- Redis实现类似同步方法调用的功能(一)
- Android零基础入门第39节:ListActivity和自定义列表项
- 简单理解数据库表及和数组之间的关系
- Leetcode-98: Validate Binary Search Tree
- MTK刷机工具Flash_Tool部分4032错误解决办法
- zoj3211(贪心+dp)