传送门
题解:
发现是个基环树森林。也就是仙人掌森林,俗称荒漠,直接上Link-Cut-Cactus就行了
发现有的方程会形成环,我们对于每个连通块,定一个根节点,然后根节点的父亲设置为Special_Father。这样每次可以把环提取出来,得到根节点的解。然后access一下得到当前点与根节点的关系就可以直接算了。
需要注意的修改的时候,对于修改的是否是环上的点需要大力分类讨论一下。
代码:
#include<bits/stdc++.h>
#define ll long long
#define re register
#define gc get_char
#define cs const
namespace IO{
static cs int Rlen=1<<22|1;
static char buf[Rlen],*p1,*p2;
inline char get_char(){return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;}
inline char peek(){return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1;}
inline char ga(){while(!isalpha(peek()))++p1;return gc();}
template<typename T>
inline T get(){
char c;T num;
while(!isdigit(c=gc()));num=c^48;
while(isdigit(c=gc()))num=((num+(num<<2))<<1)+(c^48);
return num;
}
inline int gi(){return get<int>();}
}
using namespace IO;
using std::cerr;
using std::cout;
cs int mod=1e4+7;
inline int add(int a,int b){a+=b-mod;return a+(a>>31&mod);}
inline int dec(int a,int b){a-=b;return a+(a>>31&mod);}
inline int mul(int a,int b){ll r=(ll)a*b;return r>=mod?r%mod:r;}
inline int power(int a,int b,int res=1){
for(;b;b>>=1,a=mul(a,a))(b&1)&&(res=mul(res,a));
return res;
}
inline void Inc(int &a,int b){a+=b-mod;a+=a>>31&mod;}
inline void Dec(int &a,int b){a-=b;a+=a>>31&mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
int inv[mod];
inline void init_inv(){
inv[0]=inv[1]=1;
for(int re i=2;i<mod;++i)inv[i]=mul(mod-mod/i,inv[mod%i]);
}
cs int N=3e4+7;
int n,q;
struct func{
int k,b;
func():k(1),b(0){}
func(int _k,int _b):k(_k),b(_b){}
int calc(int v)cs{return add(mul(k,v),b);}
int sol()cs{return mul(inv[dec(1,k)],b);}
};
inline func operator+(cs func &a,cs func &b){
return func(mul(a.k,b.k),add(mul(a.b,b.k),b.b));
}
int son[N][2],fa[N],sp_fa[N];
func val[N],w[N];
inline bool which(int u){return son[fa[u]][1]==u;}
inline bool isrt(int u){return son[fa[u]][0]!=u&&son[fa[u]][1]!=u;}
inline void pushup(int u){w[u]=w[son[u][0]]+val[u]+w[son[u][1]];}
bool vis[N],ins[N];
void pre_dfs(int u){
ins[u]=vis[u]=true;
int v=fa[u];
if(ins[v]){
fa[u]=0;
sp_fa[u]=v;
}
if(!vis[v])pre_dfs(v);
ins[u]=false;
}
inline void Rotate(int u){
int p=fa[u],pp=fa[p],d=which(u);
if(!isrt(p))son[pp][which(p)]=u;
fa[u]=pp,fa[p]=u,fa[son[u][!d]]=p;
son[p][d]=son[u][!d],son[u][!d]=p;
w[u]=w[p];pushup(p);
}
inline void Splay(int u){
for(int re p=fa[u];!isrt(u);Rotate(u),p=fa[u])
if(!isrt(p))Rotate(which(u)==which(p)?p:u);
}
inline void access(int u){
for(int re ch=0;u;u=fa[ch=u])
Splay(u),son[u][1]=ch,pushup(u);
}
inline int find_rt(int u){
access(u);Splay(u);
while(son[u][0])u=son[u][0];
Splay(u);return u;
}
inline void cut(int u){
access(u),Splay(u);
fa[son[u][0]]=0;son[u][0]=0;
pushup(u);
}
inline void link(int u,int f){
access(u);Splay(u);
fa[u]=f;
}
inline int query(int u){
int rt=find_rt(u),p=sp_fa[rt];
func t1=w[rt],t2;
access(p),Splay(p);t2=w[p];
if(t2.k==1)return t2.b?-1:-2;
return t1.calc(t2.sol());
}
inline bool on_cir(int u,int rt){
int f=sp_fa[rt];
if(u==f)return true;
access(f);Splay(f);Splay(u);
return !isrt(f);
}
inline void modify(int u,int f,cs func &k){
access(u);Splay(u);
val[u]=k;pushup(u);
int rt=find_rt(u);
if(u==rt){
if(find_rt(f)==rt)sp_fa[u]=f;
else {
sp_fa[u]=0;
link(u,f);
}
}
else {
if(on_cir(u,rt)){
cut(u);link(rt,sp_fa[rt]);
sp_fa[rt]=0;
if(find_rt(f)==u)sp_fa[u]=f;
else link(u,f);
}
else {
cut(u);
if(find_rt(f)==u)sp_fa[u]=f;
else link(u,f);
}
}
}
signed main(){
#ifdef zxyoi
freopen("Dynamic_tree.in","r",stdin);
#endif
init_inv();n=gi();
for(int re i=1,k,b;i<=n;++i){
k=gi(),fa[i]=gi(),b=gi();
val[i]=w[i]=func(k,b);
}
for(int re i=1;i<=n;++i)if(!vis[i])pre_dfs(i);
q=gi();
while(q--){
switch(ga()){
case 'A':{cout<<query(gi())<<"\n";break;}
case 'C':{
int u=gi(),k=gi(),f=gi(),b=gi();
modify(u,f,func(k,b));
break;
}
}
}
return 0;
}