[BZOJ2391]Cirno的忧郁

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <cmath>
using namespace std;

int read() {
	int x = 0, f = 1; char c = getchar();
	while(!isdigit(c)){ if(c == ‘-‘) f = -1; c = getchar(); }
	while(isdigit(c)){ x = x * 10 + c - ‘0‘; c = getchar(); }
	return x * f;
}

#define maxn 2010
struct Vec {
	int x, y;
	Vec() {}
	Vec(int _, int __): x(_), y(__) {}
	bool operator < (const Vec& t) const {
		return t.y * x - t.x * y ? t.y * x - t.x * y < 0 : x * x + y * y > t.x * t.x + t.y * t.y;
	}
	// if a < b then a is on b‘s left side.
	Vec operator - (const Vec& t) const { return Vec(x - t.x, y - t.y); }
} st;
struct Point {
	Vec p; int val, id;
	Point() {}
	Point(Vec _1, int _2, int _3): p(_1), val(_2), id(_3) {}
	bool operator < (const Point& t) const { return p - st < t.p - st; }
} ps[maxn];
int cp;

struct Node {
	Vec v;
	int val, r, siz, sum;
	Node() {}
	Node(Vec _1, int _2, int _3): v(_1), val(_2), r(_3) {}
} ns[maxn];
int ToT, rt, fa[maxn], ch[2][maxn];
void maintain(int o) {
	ns[o].siz = 1; ns[o].sum = ns[o].val;
	for(int i = 0; i < 2; i++) if(ch[i][o])
		ns[o].siz += ns[ch[i][o]].siz, ns[o].sum += ns[ch[i][o]].sum;
	return ;
}
void rotate(int u) {
	int y = fa[u], z = fa[y], l = 0, r = 1;
	if(z) ch[ch[1][z]==y][z] = u;
	if(ch[1][y] == u) swap(l, r);
	fa[u] = z; fa[y] = u; fa[ch[r][u]] = y;
	ch[l][y] = ch[r][u]; ch[r][u] = y;
	maintain(y); maintain(u);
	return ;
}
int insert(int& o, Point x, Point Org) {
	if(!o) {
		ns[o = ++ToT] = Node(x.p, x.val, rand());
		maintain(o);
		return x.val;
	}
	bool d = x.p - Org.p < ns[o].v - Org.p; d ^= 1;
	int ans = 0, ls = ch[0][o] ? ns[ch[0][o]].sum : 0;
	if(d) ans += ls + ns[o].val;
	ans += insert(ch[d][o], x, Org); fa[ch[d][o]] = o;
	if(ns[ch[d][o]].r > ns[o].r) {
		int t = ch[d][o];
		rotate(t); o = t;
	}
	maintain(o);
	return ans;
}

int pid[maxn], tot[maxn][maxn], n, m;
void init() {
	sort(ps + 1, ps + cp + 1);
	for(int i = 1; i <= (cp >> 1); i++) swap(ps[i], ps[cp-i+1]);
	for(int i = 1; i <= cp; i++) if(ps[i].id <= n) pid[ps[i].id] = i;
//	for(int i = 1; i <= cp; i++) printf("point[%d]: %d %d\n", i, ps[i].p.x, ps[i].p.y);
	for(int i = 1; i <= cp; i++) {
		memset(fa, 0, sizeof(fa));
		memset(ch, 0, sizeof(ch));
		rt = ToT = 0;
		for(int j = i; j <= cp; j++) {
			tot[i][j] = insert(rt, ps[j], ps[i]);
			if(i != j) tot[j][i] = -tot[i][j];
//			printf("%d %d: %d\n", i, j, tot[i][j]);
		}
	}
	
	return ;
}

int rps[maxn], get[maxn];
int main() {
	n = read(); m = read();
	st = Vec(-10001, -10001);
	for(int i = 1; i <= n; i++) {
		int x = read(), y = read();
		ps[i] = Point(Vec(x, y), 0, i);
	}
	for(int i = 1; i <= m; i++) {
		int x = read(), y = read(), v = read();
		ps[i+n] = Point(Vec(x, y), v, i + n);
	}
	cp = n + m;
	
	init();
	int q = read();
	while(q--) {
		int t = read();
		for(int i = 0; i < t; i++) rps[i] = pid[read()];
//		for(int i = 0; i < t; i++) printf("%d%c", rps[i], i < t - 1 ? ‘ ‘ : ‘\n‘);
		int ans = 0;
		for(int i = 0; i < t; i++) ans += tot[rps[i]][rps[(i+1)%t]];
		printf("%d\n", abs(ans));
	}
	
	return 0;
}