1 #define D double
 2 #define lch u<<1
 3 #include<stdio.h>
 4 #define rch u<<1|1
 5 #define M (l+r>>1)
 6 #include<algorithm>
 7 #define Up Sum[u]=Sum[lch]+Sum[rch]
 8 #define go(i,a,b) for(int i=a;i<=b;i++)
 9 #define Rar(a) a=lower_bound(T+1,T+n+1,a)-T
10 using namespace std;
11 const int N=250003;char c[N];
12 int C,m,t,tt,kk,k,n,len[N],T[N],I,J;
13 D A[N*4],B[N*4],Sum[N*4],G[N*4],ratio,ans;
14 struct Q{int l,r;}q[N];struct P{int x,y;}p[N][7];
15 D Cal(D a,int s,D rate){return 1.0*a+1.0*s*rate;}
16 void build(int u,int l,int r)
17 {
18     A[u]=B[u]=Sum[u]=G[u]=0;if(l+1==r)return;
19     build(lch,l,M);build(rch,M,r);
20 }
21 void Down(int u,int l,int r)
22 {
23     G[lch]+=G[u],G[rch]+=G[u];A[lch]+=A[u];B[rch]+=B[u];
24     D Z=Cal(A[u],T[M]-T[l],G[u]);
25     Sum[lch]+=1.0*(A[u]+Z)*(T[M]-T[l])/2;
26     Sum[rch]+=1.0*(Z+B[u])*(T[r]-T[M])/2;
27     B[lch]+=Z,A[rch]+=Z,A[u]=B[u]=G[u]=0;
28 }
29 void update(int u,int l,int r,int L,int R,D a,D b)
30 {
31     if(L<=l&&r<=R){A[u]+=a;B[u]+=b;G[u]+=ratio;
32     Sum[u]+=1.0*(a+b)*(T[r]-T[l])/2;return;}Down(u,l,r);
33     if(R<=M)update(lch,l,M,L,R,a,b);
34     else if(L>=M)update(rch,M,r,L,R,a,b);
35     else{D Z=Cal(a,T[M]-T[L],ratio);
36     update(lch,l,M,L,M,a,Z);update(rch,M,r,M,R,Z,b);}Up;
37 }
38 void query(int u,int l,int r,int L,int R)
39 {
40     if(L<=l&&r<=R){ans+=Sum[u];return;};Down(u,l,r);
41     if(L<M)query(lch,l,M,L,R);
42     if(R>M)query(rch,M,r,L,R);
43 }
44 int main(){scanf("%d",&C);while(C--&&scanf("%d",&m))
45 {
46     n=k=t=tt=kk=0;
47     go(i,1,m){scanf(" %c",&c[i]);
48     if(c[i]=='R'&&scanf("%d",&len[++t]))
49     go(j,1,len[t])scanf("%d%d",&p[t][j].x,&p[t][j].y),T[++n]=p[t][j].x;
50     if(c[i]=='Q'&&scanf("%d%d",&q[k].l,&q[++k].r))T[++n]=q[k].l,T[++n]=q[k].r;}
51
52     sort(T+1,T+n+1);n=unique(T+1,T+n+1)-T-1;
53     go(i,1,k)Rar(q[i].l),Rar(q[i].r);build(1,1,n);
54     go(i,1,t)go(j,1,len[i])Rar(p[i][j].x);
55
56     go(i,1,m)if(c[i]=='R'&&++tt)go(j,1,len[tt])
57     {
58         I=j,J=j!=len[tt]?j+1:1;
59         int x1=p[tt][I].x,y1=p[tt][I].y,x2=p[tt][J].x,y2=p[tt][J].y;
60         if(x1<x2)y1*=-1,y2*=-1;else swap(x1,x2),swap(y1,y2);
61         ratio=1.0*(y2-y1)/(T[x2]-T[x1]);update(1,1,n,x1,x2,y1,y2);
62     }
63     else ++kk,ans=0,query(1,1,n,q[kk].l,q[kk].r),printf("%.3f\n",ans);
64 }return 0;}//Paul_Guderian