【洛谷 P3249】【HNOI2016】矿区（最小左转法 / 生成树）

传送门

最小左转法：
用来将平面图转成对偶图
先将线段拆成两个有向线段

考虑对于每个有向线段$(u\to v)$
在$v$连出的有向线段中按极角找$(v\to u)$的下一个
这样一定恰好形成一个平面

另外将整个图形外面的也看做一个点
查找可以用$vector$按极角排序每次二分
复杂度$O(nlogn)$

---

考虑先最小左转法转成对偶图
对于每个点显然可以求出这块区域的面积

考虑建出任意一颗生成树，以整个外围为根
每个点记录子树$S^2,S$之和
对于询问按照给定顺序遍历边
如果该边左右的点不相连不管
如果连向的是父亲则加上当前点的值
否则即为儿子，减去儿子的值

具体可以参见代码
我代码中每次是向右转
不影响正确性

#include<bits/stdc++.h>
using namespace std;
#define cs const
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define bg begin
#define fi first
#define se second
cs int RLEN=1<<20|1;
inline char gc(){
	static char ibuf[RLEN],*ib,*ob;
	(ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
	return (ib==ob)?EOF:*ib++;
}
inline int read(){
	char ch=gc();
	int res=0;bool f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
inline ll readll(){
	char ch=gc();
	ll res=0;bool f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
inline int readstring(char *s){
	int top=0;char ch=gc();
	while(isspace(ch))ch=gc();
	while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
	return top;
}
template<typename tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<typename tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
namespace Module{
cs int mod=998244353;
inline int add(int a,int b){return (a+b>=mod)?(a+b-mod):(a+b);}
inline int dec(int a,int b){return (a<b)?(a-b+mod):(a-b);}
inline int mul(int a,int b){static ll r;r=1ll*a*b;return (r>=mod)?(r%mod):r;}
inline void Add(int &a,int b){a=(a+b>=mod)?(a+b-mod):(a+b);}
inline void Dec(int &a,int b){a=(a<b)?(a-b+mod):(a-b);}
inline void Mul(int a,int b){static ll r;r=1ll*a*b;a=(r>=mod)?(r%mod):r;}
inline int ksm(int a,int b,int res=1){for(;b;b>>=1,Mul(a,a))(b&1)&&(Mul(res,a),1);return res;}
inline int Inv(int x){return ksm(x,mod-2);}
inline int fix(ll x){x%=mod,(x<0)&&(x+=mod);return x;}
}
struct pt{
	double x,y;
	pt(double _x=0,double _y=0):x(_x),y(_y){}
	friend inline pt operator +(cs pt &a,cs pt &b){
		return pt(a.x+b.x,a.y+b.y);
	}
	friend inline pt operator -(cs pt &a,cs pt &b){
		return pt(a.x-b.x,a.y-b.y);
	}
	friend inline double operator *(cs pt &a,cs pt &b){
		return a.x*b.y-a.y*b.x;
	}
	friend inline double operator ^(cs pt &a,cs pt &b){
		return a.x*b.x-a.y*b.y;
	}
	friend inline pt operator *(cs pt &a,cs double &b){
		return pt(a.x*b,a.y*b);
	}
	friend inline pt operator /(cs pt &a,cs double &b){
		return pt(a.x/b,a.y/b);
	}
	inline pt move(double a,double d){return pt(x+d*cos(a),y+d*sin(a));}
	inline double ang(){return atan2(y,x);}
	inline double dis(){return sqrt(x*x+y*y);}
};
cs double eps=1e-10,INF=1e12,pi=acos(-1);
cs int N=200005,M=1200005;
pt p[N];
int n,m,q,cnt=1,rt,tot;
ll ans1,ans2;
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline int sign(double x){
	return (x>eps)-(x<-eps);
}
inline double sqr(double x){return x*x;}
struct edge{
	int id,u,v;
	double rad;
	edge(int _a=0,int _b=0,int _c=0,double _d=0):id(_a),u(_b),v(_c),rad(_d){}
	friend inline bool operator <(cs edge &a,cs edge &b){
		return sign(a.rad-b.rad)?a.rad<b.rad:a.v<b.v;
	}
}E[M];
vector<edge>e[N],tr[M];
int nxt[M],pos[M],fa[M],vis[M],intr[M],qr[M];
ll s[M],ss[M];
inline void addedge(int u,int v){
	cnt++;
	E[cnt]=edge(cnt,u,v,(p[v]-p[u]).ang());
	e[u].pb(E[cnt]);
}
inline void build(){
	for(int i=1;i<=n;i++)sort(e[i].bg(),e[i].end());
	for(int i=2;i<=cnt;i++){
		int v=E[i].v,ps=lower_bound(e[v].bg(),e[v].end(),E[i^1])-e[v].bg()+1;
		if(ps==e[v].size())ps=0;
		nxt[i]=e[v][ps].id;
	}
	for(int i=2;i<=cnt;i++)if(!pos[i]){
		pos[i]=pos[nxt[i]]=++tot;
		for(int j=nxt[i];E[j].v!=E[i].u;j=nxt[j],pos[j]=tot)
		s[tot]+=(p[E[j].v]-p[E[i].u])*(p[E[j].u]-p[E[i].u]);
		if(s[tot]<=0)rt=tot;
	}
	for(int i=2;i<=cnt;i++)tr[pos[i]].pb(edge(i,0,pos[i^1],0));
}
void dfs(int u){
	ss[u]=s[u]*s[u],s[u]*=2,vis[u]=1;
	for(edge &x:tr[u])if(!vis[x.v]){
		intr[x.id]=intr[x.id^1]=1;
		fa[x.v]=u,dfs(x.v);
		s[u]+=s[x.v],ss[u]+=ss[x.v];
	}
}
inline void solve(){
	int m=(read()+ans1)%n+1;
	for(int i=1;i<=m;i++)qr[i]=(read()+ans1)%n+1;
	qr[m+1]=qr[1],ans1=ans2=0;
	for(int i=1;i<=m;i++){
		int u=qr[i],v=qr[i+1];
		int ps=lower_bound(e[u].bg(),e[u].end(),edge(0,u,v,(p[v]-p[u]).ang()))->id;
		if(!intr[ps])continue;
		if(fa[pos[ps]]==pos[ps^1])ans1+=ss[pos[ps]],ans2+=s[pos[ps]];
		else ans1-=ss[pos[ps^1]],ans2-=s[pos[ps^1]];
	}
	ll g=gcd(ans1,ans2);ans1/=g,ans2/=g;
	cout<<ans1<<" "<<ans2<<'\n';
}
int main(){
	#ifdef Stargazer
	freopen("lx.in","r",stdin);
	#endif
	n=read(),m=read(),q=read();
	for(int i=1;i<=n;i++)p[i].x=read(),p[i].y=read();
	for(int i=1;i<=m;i++){
		int u=read(),v=read();
		addedge(u,v),addedge(v,u);
	}
	build(),dfs(rt);
	while(q--)solve();
	return 0;
}