|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
An exhibition of tapestries is opening in Byteotian Museum of Fine Arts. The main exhibition room, viewed from top, is a polygon (not necessarily convex). A tapestry is hanged on each wall of the room, each tapestry taking all the area of its wall.
A lamp has been installed in the room in order to illuminate the exhibition. The lamp is glowing uniformly in all directions. However, while some of the tapestries have to be flooded with light, others cannot be exposed to strong light.
Byteasar, the curator, has been moving the lamp around the room, but so far he is not satisfied with the results. Now he is terrified by the prospect of moving the tapestries around instead - this would require much effort, and the exhibition is to open soon. Perhaps you will be able to tell him if his attempts are doomed or not?
Your task is to determine if there is such a spot that placing the lamp in it satisfies the following:
There is a single integer t(1 ≤ t ≤ 20) in the first line of the standard input, denoting the number of data sets. The following lines describe these data sets.
The first line of a single description holds a single integer n(3 ≤ n ≤ 1,000), denoting the number of walls in the main exhibition room. Then the following n lines specify the room's shape. Each of those lines contains a pair of integers xi and yi(-30,000 ≤ xi,yi ≤ 30,000 for i=1,2,…,n), separated by a single space, denoting the coordinates of the room's corner or, in other words, the vertex of corresponding polygon. The vertices are given clockwise.
The next lines specify the tapestries' requirements. Each of those lines contains a single letter, S or C, denoting that the wall has to be illuminated or shaded, respectively. The letter in the i-th of these lines (for 1 ≤ i ≤ n-1) regards the wall between the i-th and the (i+1)-th vertex. The letter in the last of these lines regards the wall between the last and the first vertex.
The polygon depicting the room's shape has no self-crossings, i.e., with the exception of successive sides, which share a common vertex, no two sides of the polygon share a common point. Furthermore, no three vertices of the polygon are collinear.
For each data set your program should print to the standard output a single line containing a single word:
1 16 5 -3 4 -4 3 -7 0 -5 -3 -7 -4 -4 -5 -3 -1 -1 -4 3 -2 4 -1 2 0 7 1 2 2 4 4 3 1 -1 C S S S S C C S S C S S C S S C
2 3 0 0 0 1 1 0 S C S 3 0 0 0 1 1 0 S S S