結果
| 問題 | No.3608 Golden Steiner Tree |
| コンテスト | |
| ユーザー |
 Taiki0715
|
| 提出日時 | 2026-07-31 22:41:48 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.90.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 16,439 bytes |
| 記録 | |
| コンパイル時間 | 3,007 ms |
| コンパイル使用メモリ | 362,972 KB |
| 実行使用メモリ | 48,424 KB |
| 最終ジャッジ日時 | 2026-07-31 22:41:57 |
| 合計ジャッジ時間 | 6,327 ms |
|
ジャッジサーバーID （参考情報） |
judge2_0 / judge3_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 5 WA * 15 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}
template<typename T,size_t n>istream &operator>>(istream &is,array<T,n>&a){for(auto&i:a)is>>i;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
#define yn(x) cout<<((x)?"Yes\n":"No\n")
#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())
template<typename T>
inline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
else return init;
}
#ifdef LOCAL
#include<debug.h>
#define SWITCH(a,b) (a)
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define SWITCH(a,b) (b)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
struct Timer{
clock_t start;
Timer(){
start=clock();
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout<<fixed<<setprecision(16);
}
inline double now(){return (double)(clock()-start)/1000;}
#ifdef LOCAL
~Timer(){
cerr<<"time:";
cerr<<now();
cerr<<"ms\n";
}
#endif
}timer;
void SOLVE();
int main(){
int testcase=1;
//cin>>testcase;
for(int i=0;i<testcase;i++){
SOLVE();
}
}
template<typename T=int>
struct Edge{
int from,to;
T weight;
int index;
Edge(int from_,int to_,T weight_=T(),int index_=-1):from(from_),to(to_),weight(weight_),index(index_){}
Edge():from(-1),to(-1),weight(),index(-1){}
friend std::ostream &operator<<(std::ostream &os,const Edge&e){
os<<'[';
os<<"from:"<<e.from;
os<<"to:"<<e.to;
os<<"weight:"<<e.weight;
os<<"index:"<<e.index;
os<<']';
return os;
}
};
template<typename T=int>
struct Tree{
int n,r;
std::vector<Edge<T>>edge;
std::vector<Edge<T>>g;
std::vector<int>ptr;
struct tree_range{
using iterator=typename std::vector<Edge<T>>::iterator;
iterator l,r;
iterator begin()const{return l;}
iterator end()const{return r;}
int size()const{return r-l;}
bool empty()const{return !size();}
Edge<T> &operator[](int i)const{return l[i];}
};
struct const_tree_range{
using iterator=typename std::vector<Edge<T>>::const_iterator;
iterator l,r;
iterator begin()const{return l;}
iterator end()const{return r;}
int size()const{return r-l;}
bool empty()const{return !size();}
const Edge<T> &operator[](int i)const{return l[i];}
};
explicit Tree(int n_):n(n_){
edge.reserve(n-1);
}
Tree():n(0){}
Tree(int n_,const std::vector<Edge<T>>&e,bool dir=false):n(n_),r(-1),edge(e){
if(!dir)build();
else{
std::vector<bool>seen(n,false);
ptr.resize(n+1);
for(const Edge<T>&i:edge)ptr[i.from]++,ptr[i.to]++,seen[i.to]=true;
for(int i=1;i<=n;i++)ptr[i]+=ptr[i-1];
r=std::find(seen.begin(),seen.end(),false)-seen.begin();
assert(ptr[n]==n*2-2);
g.resize(ptr[n]);
for(const Edge<T>&i:edge)g[--ptr[i.to]]=Edge<T>(i.to,i.from,i.weight,i.index);
for(const Edge<T>&i:edge)g[--ptr[i.from]]=i;
}
}
template<bool weighted=false,bool index=1>
void read(){
for(int i=0;i<n-1;i++){
int u,v;
T w=T();
std::cin>>u>>v;
if constexpr(index)u--,v--;
if constexpr(weighted)std::cin>>w;
else w=1;
edge.emplace_back(u,v,w,i);
}
build();
}
template<bool index=1>
void readp(){
ptr.resize(n+1);
for(int i=1;i<n;i++){
int p;
std::cin>>p;
if constexpr(index)p--;
edge.emplace_back(p,i,1,i-1);
ptr[p]++;
ptr[i]++;
}
for(int i=1;i<=n;i++)ptr[i]+=ptr[i-1];
g.resize(n*2-2);
for(auto&&[u,v,w,i]:edge)g[--ptr[v]]=Edge<T>(v,u,w,i);
for(int i=0;i<n-1;i++){
g[--ptr[edge[i].from]]=edge[i];
}
r=0;
}
void add_edge(int u,int v){edge.emplace_back(u,v,1,edge.size());}
void add_edge(int u,int v,T w){edge.emplace_back(u,v,w,edge.size());}
void add_edge(int u,int v,T w,int idx){edge.emplace_back(u,v,w,idx);}
inline bool is_directed()const{return r!=-1;}
void build(){
r=-1;
ptr.assign(n+1,0);
for(auto&&[u,v,w,i]:edge)ptr[u]++,ptr[v]++;
for(int i=1;i<=n;i++)ptr[i]+=ptr[i-1];
assert(ptr[n]==n*2-2);
g.resize(n*2-2);
for(auto&&[u,v,w,i]:edge){
g[--ptr[u]]=Edge(u,v,w,i);
g[--ptr[v]]=Edge(v,u,w,i);
}
}
void remove_parent(int root=0){
if(r!=-1){
if(r!=root)build();
else return;
}
edge.resize(n-1);
std::vector<int>par(n,-1);
par[root]=-1;
std::queue<int>que;
que.push(root);
while(!que.empty()){
int x=que.front();
que.pop();
for(int i=ptr[x];i<ptr[x+1];){
const Edge<T>&e=g[i];
if(e.to!=par[x]){
par[e.to]=x;
assert(e.index<n-1);
edge[e.index]=e;
que.push(e.to);
i++;
}
else{
if(i+1==ptr[x+1])break;
std::swap(g[i],g[ptr[x+1]-1]);
}
}
}
r=root;
}
void re_index(){
assert((int)edge.size()==n-1);
for(int i=0;i<n-1;i++)edge[i].index=i;
build();
if(r!=-1)remove_parent(r);
}
std::vector<int>bfs_order()const{
assert(is_directed());
std::vector<int>bfs(n);
int p=0,q=0;
bfs[q++]=root();
while(p<q){
int x=bfs[p++];
for(const Edge<T>&e:(*this)[x])bfs[q++]=e.to;
}
return bfs;
}
std::vector<int>dfs_order()const{
assert(is_directed());
std::vector<int>res;
res.reserve(n);
std::vector<int>st(n);
int p=0;
st[p++]=root();
while(p){
int x=st[--p];
res.push_back(x);
p+=(*this)[x].size();
for(const Edge<T>&e:(*this)[x])st[--p]=e.to;
p+=(*this)[x].size();
}
return res;
}
std::vector<int>rbfs_order()const{
std::vector<int>bfs=bfs_order();
std::reverse(bfs.begin(),bfs.end());
return bfs;
}
void hld(){
assert(is_directed());
std::vector<int>sub(n);
for(int x:rbfs_order()){
sub[x]=1;
int mx=-1;
for(Edge<T>&e:(*this)[x]){
sub[x]+=sub[e.to];
if(mx<sub[e.to]){
mx=sub[e.to];
std::swap((*this)[x][0],e);
}
}
}
}
std::pair<std::vector<int>,std::vector<int>>in_out_order(){
assert(is_directed());
std::vector<int>in(n),out(n);
int p=0;
auto dfs=[&](auto self,int x)->void {
in[x]=p++;
for(const Edge<T>&e:(*this)[x]){
self(self,e.to);
}
out[x]=p;
};
dfs(dfs,root());
return std::make_pair(in,out);
}
std::pair<T,std::vector<int>>diameter()const{
assert(!is_directed());
static constexpr T inf=std::numeric_limits<T>::max();
std::vector<T>dst(n,inf);
dst[0]=0;
std::vector<int>que(n);
int p=0,q=1;
que[0]=0;
while(p<q){
int x=que[p++];
for(const Edge<T>&e:(*this)[x])if(dst[e.to]==inf){
dst[e.to]=dst[x]+e.weight;
que[q++]=e.to;
}
}
int u=std::max_element(dst.begin(),dst.end())-dst.begin();
std::fill(dst.begin(),dst.end(),inf);
dst[u]=0;
p=0,q=1;
que[0]=u;
while(p<q){
int x=que[p++];
for(const Edge<T>&e:(*this)[x])if(dst[e.to]==inf){
dst[e.to]=dst[x]+e.weight;
que[q++]=e.to;
}
}
int v=std::max_element(dst.begin(),dst.end())-dst.begin();
T weight=dst[v];
std::vector<int>res;
while(u!=v){
res.push_back(v);
for(const Edge<T>&e:(*this)[v])if(dst[e.to]<dst[v]){
v=e.to;
break;
}
}
res.push_back(u);
return std::make_pair(weight,res);
}
int size()const{return n;}
tree_range operator[](int i){return tree_range{g.begin()+ptr[i],g.begin()+ptr[i+1]-(r!=-1&&r!=i)};}
const_tree_range operator[](int i)const{return const_tree_range{g.begin()+ptr[i],g.begin()+ptr[i+1]-(r!=-1&&r!=i)};}
const Edge<T>& get_edge(int i)const{return edge[i];}
inline int parent(int i)const{return i==r?-1:g[ptr[i+1]-1].to;}
const Edge<T>& parent_edge(int i)const{
assert(r!=-1&&i!=r);
return g[ptr[i+1]-1];
}
inline int root()const{return r;}
typename std::vector<Edge<T>>::iterator begin(){return edge.begin();}
typename std::vector<Edge<T>>::iterator end(){return edge.end();}
typename std::vector<Edge<T>>::const_iterator begin()const{return edge.begin();}
typename std::vector<Edge<T>>::const_iterator end()const{return edge.end();}
};
struct StaticTopTree{
private:
template<typename T>
void build(Tree<T>t){
int n=t.size();
left.reserve(n*2-1),right.reserve(n*2-1),par.reserve(n*2-1),A.reserve(n*2-1),B.reserve(n*2-1);
left.resize(n,-1),right.resize(n,-1),par.resize(n,-1),A.resize(n),B.resize(n);
for(int i=0;i<n;i++){
A[i]=t.parent(i);
B[i]=i;
}
auto dfs=[&](auto self,int x)->std::pair<int,int> {
std::vector<std::pair<int,int>>vs{{0,x}};
while(t[x].size()>=1){
std::priority_queue<std::pair<int,int>,std::vector<std::pair<int,int>>,std::greater<std::pair<int,int>>>que;
int heavy=t[x][0].to;
que.emplace(0,heavy);
for(int i=1;i<t[x].size();i++)que.push(self(self,t[x][i].to));
while((int)que.size()>=2){
auto [d1,v1]=que.top();que.pop();
auto [d2,v2]=que.top();que.pop();
if(B[v2]==heavy)std::swap(d1,d2),std::swap(v1,v2);
int nv=left.size();
left.push_back(v1),right.push_back(v2),par.push_back(-1),A.push_back(x),B.push_back(B[v1]);
par[v1]=par[v2]=nv;
que.emplace(std::max(d1,d2)+1,nv);
}
vs.push_back(que.top());
while(true){
int sz=vs.size();
if(sz>=3&&(vs[sz-3].first==vs[sz-2].first||vs[sz-3].first<=vs[sz-1].first)){
int nv=left.size();
left.push_back(vs[sz-3].second),right.push_back(vs[sz-2].second),par.push_back(-1),A.push_back(A[vs[sz-3].second]),B.push_back(B[vs[sz-2].second]);
par[vs[sz-3].second]=par[vs[sz-2].second]=nv;
vs[sz-3].first=std::max(vs[sz-3].first,vs[sz-2].first)+1;
vs[sz-3].second=nv;
vs[sz-2]=vs[sz-1];
vs.pop_back();
}
else if(sz>=2&&vs[sz-2].first<=vs[sz-1].first){
int nv=left.size();
left.push_back(vs[sz-2].second),right.push_back(vs[sz-1].second),par.push_back(-1),A.push_back(A[vs[sz-2].second]),B.push_back(B[vs[sz-1].second]);
par[vs[sz-2].second]=par[vs[sz-1].second]=nv;
vs[sz-2].first=std::max(vs[sz-2].first,vs[sz-1].first)+1;
vs[sz-2].second=nv;
vs.pop_back();
}
else break;
}
x=heavy;
}
while((int)vs.size()>=2){
int sz=vs.size();
int nv=left.size();
left.push_back(vs[sz-2].second),right.push_back(vs[sz-1].second),par.push_back(-1),A.push_back(A[vs[sz-2].second]),B.push_back(B[vs[sz-1].second]);
par[vs[sz-2].second]=par[vs[sz-1].second]=nv;
vs[sz-2].first=std::max(vs[sz-2].first,vs[sz-1].first)+1;
vs[sz-2].second=nv;
vs.pop_back();
}
return vs[0];
};
dfs(dfs,t.root());
}
public:
std::vector<int>left,right,par,A,B;
StaticTopTree(){}
template<typename T>
explicit StaticTopTree(Tree<T>t,int){
build(std::move(t));
}
template<typename T>
explicit StaticTopTree(Tree<T>t){
assert(t.is_directed());
t.hld();
build(std::move(t));
}
};
template<typename DP>
struct DynamicTreeDP{
private:
using Data=typename DP::Data;
std::vector<Data>data;
StaticTopTree stt;
inline void update(int x){
int l=stt.left[x],r=stt.right[x];
if(stt.A[l]==stt.A[r])data[x]=DP::rake(data[l],data[r]);
else data[x]=DP::compress(data[l],data[r]);
}
public:
DynamicTreeDP(){}
template<typename T>
explicit DynamicTreeDP(Tree<T>t,std::vector<Data>init){
assert(t.size()==(int)init.size());
int n=t.size();
stt=StaticTopTree(std::move(t));
data=std::move(init);
data.resize(n*2-1);
for(int i=n;i<n*2-1;i++)update(i);
}
void set(int x,Data v){
data[x]=std::move(v);
for(x=stt.par[x];x!=-1;x=stt.par[x])update(x);
}
inline Data get()const{return data.back();}
};
struct M{
struct Inner{
bool cont;
int sum;
int head,tail;
int common;
Inner(){}
Inner(bool bw,bool rb){
cont=bw;
sum=0;
sum=0;
head=0,tail=0;
common=0;
if(rb){
head=1;
}
}
ll eval(ll cost){
return cost*sum;
}
};
struct Data{
Inner red,blue;
Data(){}
Data(bool bw,bool rb):red(bw,rb),blue(bw,!rb){}
ll eval(ll r,ll b){
return red.eval(r)+blue.eval(b);
}
};
static Inner compress(Inner lhs,Inner rhs){
Inner res;
res.cont=lhs.cont||rhs.cont;
if(!res.cont){
res.sum=0;
res.head=lhs.head+rhs.head;
res.tail=0;
res.common=0;
return res;
}
res.sum=lhs.sum+rhs.sum;
if(lhs.cont&&rhs.cont){
res.sum+=lhs.tail+rhs.head+lhs.common+rhs.common;
res.head=lhs.head;
res.tail=rhs.tail;
res.common=0;
}
else if(lhs.cont){
res.head=lhs.head;
res.tail=lhs.tail+rhs.head;
res.common=lhs.common;
}
else{
res.head=lhs.head+rhs.head;
res.tail=rhs.tail;
res.common=rhs.common;
}
return res;
}
static Inner rake(Inner lhs,Inner rhs){
Inner res;
res.cont=lhs.cont||rhs.cont;
if(!res.cont){
res.sum=0;
res.head=lhs.head;
res.tail=0;
res.common=0;
return res;
}
res.sum=lhs.sum+rhs.sum;
if(lhs.cont&&rhs.cont){
res.sum+=lhs.head+rhs.head+lhs.common+rhs.common;
res.head=0;
res.tail=lhs.tail;
res.common=0;
}
else if(lhs.cont){
res.head=lhs.head;
res.tail=lhs.tail;
res.common=lhs.common;
}
else{
res.head=0;
res.tail=lhs.head;
res.common=rhs.head;
}
return res;
}
static Data compress(Data lhs,Data rhs){
Data res;
res.red=compress(lhs.red,rhs.red);
res.blue=compress(lhs.blue,rhs.blue);
return res;
}
static Data rake(Data lhs,Data rhs){
Data res;
res.red=rake(lhs.red,rhs.red);
res.blue=rake(lhs.blue,rhs.blue);
return res;
}
};
void SOLVE(){
int n;
ll r,b;
cin>>n>>r>>b;
Tree t(n);
double phi=(sqrt(5)+1)/2;
rep(i,1,n+1){
int j=i*phi;
if(i<j&&j<=n)t.add_edge(i-1,j-1,1);
j=i*phi*phi;
if(i<j&&j<=n)t.add_edge(i-1,j-1,0);
}
t.build();
for(auto e:t)debug(e.from,e.to);
t.remove_parent();
vector<M::Data>init(n);
vector<int>col(n);
rep(i,n){
int c=0;
if(i!=0)c=t.parent_edge(i).weight;
init[i]=M::Data(0,c);
}
DynamicTreeDP<M>dp(t,init);
int q;
cin>>q;
while(q--){
int type,x;
cin>>type>>x;
if(type==1){
x--;
col[x]^=1;
int c=0;
if(x!=0)c=t.parent_edge(x).weight;
init[x]=M::Data(col[x],c);
dp.set(x,init[x]);
}
else if(type==2)r=x;
else b=x;
debug(dp.get().red.sum,dp.get().blue.sum);
cout<<dp.get().eval(r,b)<<'\n';
}
}