以 QOJ#3029 为例，记录一下 MatrixGroup 的当前码风
MatrixGroup · · 个人记录
上期回顾
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0,del##i##verme=int(n);i<del##i##verme;++i)
#define rep1(i,n) for(int i=1,parano##i##a=int(n);i<=parano##i##a;++i)
#define per(i,n) for(int i=int(n)-1;i>=0;--i)
#define per1(i,n) for(int i=int(n);i>=1;--i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define y0 LingLuo
#define y1 VividCycle
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldb;
using namespace std;
const ll mod1=998244353;
const ll mod2=1000000007;
unsigned time_related_rand()
{
return unsigned(std::chrono::steady_clock::now().time_since_epoch().count());
}
struct segtree{
ll mn[4194304],mx[4194304];
void build(int i,int l,int r,ll *a)
{
if(l==r)
{
mn[i]=mx[i]=a[l];
}
else
{
int m=(l+r)>>1;
build(i<<1,l,m,a);build(i<<1|1,m+1,r,a);
mx[i]=max(mx[i<<1],mx[i<<1|1]);
mn[i]=min(mn[i<<1],mn[i<<1|1]);
}
}
int query(int i,int il,int ir,int ql,int qr,ll L,ll R)
{
if(il>qr||ql>ir) return -1;
if(mn[i]>=L&&mx[i]<=R) return -1;
if(il==ir) return il;
int m=(il+ir)>>1;
int v=query(i<<1,il,m,ql,qr,L,R);
if(v!=-1) return v;
return query(i<<1|1,m+1,ir,ql,qr,L,R);
}
};
struct dsu{
int p[500005];
void init(int N)
{
rep1(i,N) p[i]=i;
}
int getp(int x)
{
return (p[x]==x)?x:(p[x]=getp(p[x]));
}
void merge(int x,int y)
{
p[getp(x)]=getp(y);
}
bool same(int x,int y)
{
return getp(x)==getp(y);
}
};
dsu D;
int t,n,m,k;ll x[500005],y[500005];
ll d[500005];int u[1500005],v[1500005];ll w[1500005];int qaq[1500005];
int q,a,b;ll h;
vector<int> E[500005];
vector<pair<int,int> > con[500005];
int eid[1500005];
int fa[20][500005],dep[500005],val[20][500005];
vector<int> toki[500005];
vector<ll> chg[500005];int shift[500005];
segtree seg;
ll SqIrt(ll X)
{
ll r=ll(sqrt(X));while(r*r<X)++r;while(r*r>X)--r;
return r;
}
bool cmp(int X,int Y)
{
return qaq[X]>qaq[Y];
}
void dfs(int ver,int par,int wei)
{
fa[0][ver]=par;dep[ver]=dep[par]+1;val[0][ver]=wei;
for(pair<int,int> P:con[ver]) if(P.fi!=par)
{
dfs(P.fi,ver,P.se);
}
}
int query(int X,int Y)
{
if(dep[X]>dep[Y])swap(X,Y);
int dif=dep[Y]-dep[X];
int ans=20120712;
per(i,20) if((dif>>i)&1)
{
ans=min(ans,val[i][Y]);Y=fa[i][Y];
}
if(X==Y) return ans;
per(i,20) if(fa[i][X]!=fa[i][Y])
{
ans=min(ans,min(val[i][X],val[i][Y]));
X=fa[i][X];Y=fa[i][Y];
}
ans=min(ans,min(val[0][X],val[0][Y]));
return ans;
}
vector<int> cur;
ll c[4194304];int cnt;
void Q()
{
cin>>n;D.init(n);
rep1(i,n)
{
cin>>x[i]>>y[i];
E[i].clear();d[i]=0;con[i].clear();
}
cin>>m;
rep1(i,m)
{
cin>>u[i]>>v[i]>>h;
E[u[i]].pb(i);E[v[i]].pb(i);
w[i]=SqIrt(h*h-(x[u[i]]-x[v[i]])*(x[u[i]]-x[v[i]])-(y[u[i]]-y[v[i]])*(y[u[i]]-y[v[i]]));
qaq[i]=20120712;
eid[i]=i;
}
cin>>k;
rep1(i,n)
{
toki[i].clear();
chg[i].clear();
toki[i].pb(0);chg[i].pb(0ll);
}
rep1(i,k)
{
cin>>a>>h;d[a]+=h;
toki[a].pb(i);chg[a].pb(d[a]);
}
cnt=0;
rep1(i,n)
{
shift[i]=cnt+1;
for(ll xx:chg[i])
{
c[++cnt]=xx;
}
}
seg.build(1,1,cnt,c);
rep1(i,m)
{
int f=u[i],g=v[i];ll dif=w[i];
if(toki[f].size()>toki[g].size()) swap(f,g);
cur.clear();
for(int xx:toki[f])
{
int id=int(upper_bound(toki[g].begin(),toki[g].end(),xx)-toki[g].begin())-1;
cur.pb(id);
}
cur.pb(int(toki[g].size())-1);
rep(_,toki[f].size())
{
int z=toki[f][_],r=cur[_],s=cur[_+1];
ll vval=chg[f][_];
if(abs(vval-chg[g][r])>dif)
{
qaq[i]=z;
break;
}
if(r!=s)
{
int qq=seg.query(1,1,cnt,shift[g]+r+1,shift[g]+s,vval-dif,vval+dif);
if(qq!=-1)
{
qq-=shift[g];
qaq[i]=toki[g][qq];
break;
}
}
}
}
sort(eid+1,eid+m+1,cmp);
rep1(_,m)
{
int i=eid[_];
if(!D.same(u[i],v[i]))
{
con[u[i]].pb(mp(v[i],qaq[i]));
con[v[i]].pb(mp(u[i],qaq[i]));
D.merge(u[i],v[i]);
}
}
dfs(1,0,0);
rep1(i,19)
{
rep1(j,n)
{
fa[i][j]=fa[i-1][fa[i-1][j]];
val[i][j]=min(val[i-1][j],val[i-1][fa[i-1][j]]);
}
}
cin>>q;
while(q--)
{
cin>>a>>b;
int ans=query(a,b);
if(ans==20120712) ans=-1;
cout<<ans<<"\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);
cin>>t;while(t--)Q();
return 0;
}