POJ 1984 Navigation Nightmate(データ構造-そして集合を検査する)

Navigation Nightmate
Time Limit: 2000 MS
 
メモリLimit: 30000 K
Total Submissions: 4072
 
Acceepted: 1615
Case Time Limit: 1000 MS
Description
Farmer John's pastoral neighborhood has N farms(2==N==40,000)、usual numberd/labeled 1.N.A series of M(1==M<40,000)vertical and horizontal roads each of varying length(1000=leth)connect the farms.A map of these farms might look something like the illustration below in which farms are labeled F 1.F 7 for cleaty and lengths between nected farms ares shows(n): 

           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,and/or west.Moreover,farms are only located the endpoints of roads,and some farmon 
(sequence of roads)links everpair of farms. 
FJ lost his paper copy of the farm map and he wants to reconstruct it from backup information on on his coput.This data contains the following、one for everroad: 
The e e e e e is a road of length 10 running north from Farm 
The re is a road of length 7 running eat from Farm 
… 
As FJ is retrieving this data,he is occasionally interrupted by questions such as the follwingth that he receives from his navigationly-challed neighbor,farmer Bob: 
What is the Manhattan distance between farms
  FJ answers Bob,when he can(sometimes he doesn't yet have enough datayet).In the example above,the answer would be 17,since Bob wants to know the「Manhattan」distance between parm.  The Manhattan distance between two points(x 1,y 1)and(x 2,y 2)is just𞓜x 1-x 2|+|y1-y 2|(which is the distance a taxicab in a large city must travel overcity)  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 approogizes 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 6
1 6 13 E
6 3 9 E
3 5 7 S
4 1 3 N
2 4 20 W
4 7 2 S
3
1 6 1
1 4 3
2 6 6

Sample Output

13
-1
10

Hit
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. 
ソurce
USACO 2004 Febrary
タイトルの大意:
n都市を与えられました.m条は都市間の相対距離を教えます.次はqグループに聞いてみます.何番目の都市で参加した後、二つの都市の距離を聞きます.
問題解決の考え方:
オフラインで処理する.各都市から父都市までの距離を維持します.
問題解決の考え方:

#include 
#include 
#include 
using namespace std;

const int maxn=41000;

struct edge{
    int u,v,dis;
    char ch;
}e[maxn];

struct node{
    int u,v,cnt,id,ans;
}a[maxn];

int n,m,q;
int father[maxn],offx[maxn],offy[maxn];

bool cmp1(node x,node y){
    return x.cnt"<

著作権声明:このブログのオリジナル記事.ブログは、同意なしに転載してはいけません.