hdu 1558 Segment set

Segment set

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4484 Accepted Submission(s): 1677

[align=left]Problem Description[/align]
A segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of segments in it. The problem is to find the size of some segment set.


[align=left]Input[/align]
In the first line there is an integer t - the number of test case. For each test case in first line there is an integer n (n<=1000) - the number of commands.
There are two different commands described in different format shown below:
P x1 y1 x2 y2 - paint a segment whose coordinates of the two endpoints are (x1,y1),(x2,y2). Q k - query the size of the segment set which contains the k-th segment.
k is between 1 and the number of segments in the moment. There is no segment in the plane at first, so the first command is always a P-command.

[align=left]Output[/align]
For each Q-command, output the answer. There is a blank line between test cases.

[align=left]Sample Input[/align]

1
10

P 1.00 1.00 4.00 2.00
P 1.00 -2.00 8.00 4.00

Q 1

P 2.00 3.00 3.00 1.00
Q 1

Q 3

P 1.00 4.00 8.00 2.00

Q 2

P 3.00 3.00 6.00 -2.00

Q 5

[align=left]Sample Output[/align]

1

2

2

2

5