Elven Postman

Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1108    Accepted Submission(s): 587

Problem Description

Elves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be taken lightly. Also, they live on trees. However, there is something about them you may not know. Although delivering stuffs through magical teleportation is extremely convenient (much like emails). They still sometimes prefer other more “traditional” methods.

So, as a elven postman, it is crucial to understand how to deliver the mail to the correct room of the tree. The elven tree always branches into no more than two paths upon intersection, either in the east direction or the west. It coincidentally looks awfully like a binary tree we human computer scientist know. Not only that, when numbering the rooms, they always number the room number from the east-most position to the west. For rooms in the east are usually more preferable and more expensive due to they having the privilege to see the sunrise, which matters a lot in elven culture.

Anyways, the elves usually wrote down all the rooms in a sequence at the root of the tree so that the postman may know how to deliver the mail. The sequence is written as follows, it will go straight to visit the east-most room and write down every room it encountered along the way. After the first room is reached, it will then go to the next unvisited east-most room, writing down every unvisited room on the way as well until all rooms are visited.

Your task is to determine how to reach a certain room given the sequence written on the root.

For instance, the sequence 2, 1, 4, 3 would be written on the root of the following tree.

Input

First you are given an integer T(T≤10) indicating the number of test cases.

For each test case, there is a number n(n≤1000) on a line representing the number of rooms in this tree. n integers representing the sequence written at the root follow, respectively a1,...,an where a1,...,an∈{1,...,n}.

On the next line, there is a number q representing the number of mails to be sent. After that, there will be q integers x1,...,xq indicating the destination room number of each mail.

Output

For each query, output a sequence of move (E or W) the postman needs to make to deliver the mail. For that E means that the postman should move up the eastern branch and W the western one. If the destination is on the root, just output a blank line would suffice.

Note that for simplicity, we assume the postman always starts from the root regardless of the room he had just visited.

Sample Input

2
4
2 1 4 3
3
1 2 3
6
6 5 4 3 2 1
1
1

Sample Output

E

WE
EEEEE

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <string>
 4 #include <iostream>
 5 #include <algorithm>
 6 using namespace std;
 7
 8 int main()
 9 {
10     int T;
11     int n,q;
12     int a[1005],c[1005];
13     int i,j,k;
14     string b[1005];
15     scanf("%d",&T);
16     while(T--)
17     {
18         scanf("%d",&n);
19         for(i=1;i<=n;i++)
20         {
21             scanf("%d",&a[i]);
22             b[a[i]]="";
23         }
24         scanf("%d",&q);
25         for(i=1;i<=q;i++)
26             scanf("%d",&c[i]);
27
28         for(i=2;i<=n;i++)
29         {
30             int mx=9999,mi=0,mxnum=0,minum=0;
31             for(j=1;j<i;j++)
32             {
33                 if(a[j]>a[i] && a[j]<mx)
34                 {
35                     mx=a[j],mxnum=j;
36                 }
37                 if(a[j]<a[i] && a[j]>mi)
38                 {
39                     mi=a[j],minum=j;
40                 }
41             }
42             //printf("$#$ %d %d %d %d #$\n",mx,mxnum,mi,minum);
43             if(mxnum>minum)
44             {
45                 b[a[i]]=b[a[mxnum]]+‘E‘;
46             }
47             else
48             {
49                 b[a[i]]=b[a[minum]]+‘W‘;
50             }
51         }
52
53         for(i=1;i<=q;i++)
54             cout << b[c[i]] << endl;
55     }
56     return 0;
57 }