解题思路:
我们先把所有点极角排序,固定点价值视为0,预处理出sum[i][j]表示极点O到点i(固定点)和极点到点j(固定点)所圈成的三角形内的青蛙价值,逆时针为正,顺时针为负,那对于一次询问,只需要像求多边形面积一样把相邻两点的sum加起来即可。
那如何预处理出sum[i][j]呢?我们可以枚举i并以Oi为初始抽,逆时针加入j点,算出向量Oi与向量ij的cos值,若之前加入的一个点k在三角形Oij内,则定有cos(Oi,ik)<=cos(Oi,ij)(如图),用Splay维护加入点的cos值和点值之和,每次找比小等于j的cos的点值之和即可。
注意若一只青蛙在连线上,那顺时针时就不能减这一只。(如图中点A)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
using namespace std;
int getint()
{
int i=0,f=1;char c;
for(c=getchar();(c!='-')&&(c<'0'||c>'9');c=getchar());
if(c=='-')c=getchar(),f=-1;
for(;c>='0'&&c<='9';c=getchar())i=(i<<3)+(i<<1)+c-'0';
return i*f;
}
const int N=1005;
const double eps=1e-8;
struct point
{
double x,y;
int id,val;
point(){}
point(double _x,double _y):
x(_x),y(_y){};
inline friend point operator - (const point &a,const point &b)
{return point(a.x-b.x,a.y-b.y);}
inline friend double operator * (const point &a,const point &b)
{return a.x*b.y-a.y*b.x;}
inline double dis(){return sqrt(x*x+y*y);}
}p[N<<1],O;
int n,m;
int tot,root,son[N<<2][2],fa[N<<2],val[N<<2];
double ang[N<<2];
ll Sum[N][N],sum[N<<2];
inline bool cmp(point a,point b)
{
double det=(a-O)*(b-O);
if(det)return det>0;
return (a-O).dis()<(b-O).dis();
}
inline double Cos(point a,point b)
{return (a.x*b.x+a.y*b.y)/(a.dis()*b.dis());}
int which(int x)
{
return x==son[fa[x]][1];
}
void Rotate(int x)
{
int y=fa[x],z=fa[y],t=which(x);
if(y==root)root=x;
else son[z][which(y)]=x;
fa[x]=z,fa[y]=x;
son[y][t]=son[x][t^1],son[x][t^1]=y;
if(son[y][t])fa[son[y][t]]=y;
sum[x]=sum[y],sum[y]=sum[son[y][0]]+sum[son[y][1]]+val[y];
}
void Splay(int x,int f)
{
while(fa[x]!=f)
{
if(fa[fa[x]]!=f)
which(x)==which(fa[x])?Rotate(fa[x]):Rotate(x);
Rotate(x);
}
}
void Insert(int &u,double t,int v,int f)
{
if(!u)
{
u=++tot;fa[u]=f;
val[u]=sum[u]=v,ang[u]=t;
return;
}
if(t<ang[u])Insert(son[u][0],t,v,u);
else Insert(son[u][1],t,v,u);
sum[u]=sum[son[u][0]]+sum[son[u][1]]+val[u];
}
void pre(int st)
{
tot=root=0;
memset(son,0,sizeof(son));
memset(fa,0,sizeof(fa));
for(int i=st+1;i<=m;i++)
{
double t=Cos((p[st]-O),p[i]-p[st]);
Insert(root,t,p[i].val,0);
Splay(tot,0);
if(p[i].id)
{
Sum[p[st].id][p[i].id]=sum[son[root][0]];
Insert(root,t-eps,0,0);
Splay(tot,0);
Sum[p[i].id][p[st].id]=-sum[son[root][0]];
}
}
}
int main()
{
//freopen("lx.in","r",stdin);
//freopen("lx.out","w",stdout);
int i,j,tmp;
O.x=O.y=-10000000;
n=getint(),m=getint();
for(i=1;i<=n;i++)
{
p[i].x=getint(),p[i].y=getint();
p[i].id=i;
}
for(i=1;i<=m;i++)
{
p[i+n].x=getint(),p[i+n].y=getint();
p[i+n].val=getint();
}
m=n+m;
sort(p+1,p+m+1,cmp);
for(i=1;i<=m;i++)
if(p[i].id)pre(i);
m=getint();
while(m--)
{
ll ans=0;
n=getint()-1;
i=tmp=getint();
while(n--)
{
j=getint();
ans+=Sum[i][j];
i=j;
}
ans+=Sum[i][tmp];
cout<<abs(ans)<<'\n';
}
return 0;
}