This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub beet-aizu/library
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2871 #include<bits/stdc++.h> using namespace std; #define call_from_test #include "../../tree/eulertourforvertex.cpp" #include "../../segtree/basic/lazy.cpp" #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); int n,q; cin>>n>>q; EulerTourForVertex et(n); for(int i=1;i<n;i++){ int p; cin>>p; p--; et.add_edge(p,i); } et.build(); vector<char> cs(n); for(int i=0;i<n;i++) cin>>cs[i]; struct T{ int sum,one; T(int sum,int one):sum(sum),one(one){} }; using E = int; auto f=[](T a,T b){return T(a.sum+b.sum,a.one+b.one);}; auto g=[](T a,E b){return T(a.sum,b?a.sum-a.one:a.one);}; auto h=[](E a,E b){return a^b;}; T ti(0,0); E ei(0); SegmentTree<T, E> seg(f,g,h,ti,ei); vector<T> vs(n,ti); for(int i=0;i<n;i++) vs[et.idx(i)]=T(1,cs[i]=='G'); seg.build(vs); for(int i=0;i<q;i++){ int v; cin>>v; v--; et.exec(v,[&](int l,int r){seg.update(l,r,1);}); auto res=seg.query(0,n); cout<<(res.sum-res.one<res.one?"broccoli":"cauliflower")<<"\n"; } cout<<flush; return 0; }
#line 1 "test/aoj/2871.test.cpp" // verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2871 #include<bits/stdc++.h> using namespace std; #define call_from_test #line 1 "tree/eulertourforvertex.cpp" #line 3 "tree/eulertourforvertex.cpp" using namespace std; #endif //BEGIN CUT HERE class EulerTourForVertex{ private: vector<int> ls,rs; int pos; void dfs(int v,int p){ ls[v]=pos++; for(int u:G[v]) if(u!=p) dfs(u,v); rs[v]=pos; } public: vector< vector<int> > G; EulerTourForVertex(int n):ls(n),rs(n),G(n){} void add_edge(int u,int v){ G[u].emplace_back(v); G[v].emplace_back(u); } void build(int r=0){ pos=0; dfs(r,-1); } int idx(int v){return ls[v];} template<typename F> void exec(int v,F f){ f(ls[v],rs[v]); } }; //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif #line 1 "segtree/basic/lazy.cpp" #line 3 "segtree/basic/lazy.cpp" using namespace std; #endif //BEGIN CUT HERE template <typename T,typename E> struct SegmentTree{ using F = function<T(T,T)>; using G = function<T(T,E)>; using H = function<E(E,E)>; int n,height; F f; G g; H h; T ti; E ei; vector<T> dat; vector<E> laz; SegmentTree(F f,G g,H h,T ti,E ei): f(f),g(g),h(h),ti(ti),ei(ei){} void init(int n_){ n=1;height=0; while(n<n_) n<<=1,height++; dat.assign(2*n,ti); laz.assign(2*n,ei); } void build(const vector<T> &v){ int n_=v.size(); init(n_); for(int i=0;i<n_;i++) dat[n+i]=v[i]; for(int i=n-1;i;i--) dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]); } inline T reflect(int k){ return laz[k]==ei?dat[k]:g(dat[k],laz[k]); } inline void propagate(int k){ if(laz[k]==ei) return; laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]); laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]); dat[k]=reflect(k); laz[k]=ei; } inline void thrust(int k){ for(int i=height;i;i--) propagate(k>>i); } inline void recalc(int k){ while(k>>=1) dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1)); } void update(int a,int b,E x){ if(a>=b) return; thrust(a+=n); thrust(b+=n-1); for(int l=a,r=b+1;l<r;l>>=1,r>>=1){ if(l&1) laz[l]=h(laz[l],x),l++; if(r&1) --r,laz[r]=h(laz[r],x); } recalc(a); recalc(b); } void set_val(int a,T x){ thrust(a+=n); dat[a]=x;laz[a]=ei; recalc(a); } T query(int a,int b){ if(a>=b) return ti; thrust(a+=n); thrust(b+=n-1); T vl=ti,vr=ti; for(int l=a,r=b+1;l<r;l>>=1,r>>=1) { if(l&1) vl=f(vl,reflect(l++)); if(r&1) vr=f(reflect(--r),vr); } return f(vl,vr); } template<typename C> int find(int st,C &check,T &acc,int k,int l,int r){ if(l+1==r){ acc=f(acc,reflect(k)); return check(acc)?k-n:-1; } propagate(k); int m=(l+r)>>1; if(m<=st) return find(st,check,acc,(k<<1)|1,m,r); if(st<=l and !check(f(acc,dat[k]))){ acc=f(acc,dat[k]); return -1; } int vl=find(st,check,acc,(k<<1)|0,l,m); if(~vl) return vl; return find(st,check,acc,(k<<1)|1,m,r); } template<typename C> int find(int st,C &check){ T acc=ti; return find(st,check,acc,1,0,n); } }; //END CUT HERE #ifndef call_from_test signed CFR569_C(){ cin.tie(0); ios::sync_with_stdio(0); int n,m; cin>>n>>m; vector<int> as(n),bs(m); for(int i=0;i<n;i++) cin>>as[i]; for(int i=0;i<m;i++) cin>>bs[i]; auto f=[](int a,int b){return max(a,b);}; auto g=[](int a,int b){return a+b;}; int ti=0,ei=0; SegmentTree<int, int> seg(f,g,g,ti,ei); const int sz = 1<<20; seg.build(vector<int>(sz,0)); for(int i=0;i<n;i++) seg.update(sz-as[i],sz,+1); for(int i=0;i<m;i++) seg.update(sz-bs[i],sz,-1); int q; cin>>q; auto check=[](int d){return d>0;}; for(int i=0;i<q;i++){ int t,k,v; cin>>t>>k>>v; k--; if(t==1){ seg.update(sz-as[k],sz,-1); as[k]=v; seg.update(sz-as[k],sz,+1); } if(t==2){ seg.update(sz-bs[k],sz,+1); bs[k]=v; seg.update(sz-bs[k],sz,-1); } int pos=seg.find(0,check); cout<<(pos<0?pos:sz-pos)<<"\n"; } cout<<flush; return 0; } /* verified on 2019/10/28 https://codeforces.com/contest/1179/problem/C */ signed main(){ CFR569_C(); return 0; } #endif #line 9 "test/aoj/2871.test.cpp" #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); int n,q; cin>>n>>q; EulerTourForVertex et(n); for(int i=1;i<n;i++){ int p; cin>>p; p--; et.add_edge(p,i); } et.build(); vector<char> cs(n); for(int i=0;i<n;i++) cin>>cs[i]; struct T{ int sum,one; T(int sum,int one):sum(sum),one(one){} }; using E = int; auto f=[](T a,T b){return T(a.sum+b.sum,a.one+b.one);}; auto g=[](T a,E b){return T(a.sum,b?a.sum-a.one:a.one);}; auto h=[](E a,E b){return a^b;}; T ti(0,0); E ei(0); SegmentTree<T, E> seg(f,g,h,ti,ei); vector<T> vs(n,ti); for(int i=0;i<n;i++) vs[et.idx(i)]=T(1,cs[i]=='G'); seg.build(vs); for(int i=0;i<q;i++){ int v; cin>>v; v--; et.exec(v,[&](int l,int r){seg.update(l,r,1);}); auto res=seg.query(0,n); cout<<(res.sum-res.one<res.one?"broccoli":"cauliflower")<<"\n"; } cout<<flush; return 0; }