#725023 (C++17) No.1790 Subtree Deletion

提出ソース
結果

問題	No.1790 Subtree Deletion
ユーザー	hotman78
提出日時	2021-12-19 01:01:25
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	638 ms / 3,000 ms
コード長	17,229 bytes
コンパイル時間	6,074 ms
コンパイル使用メモリ	267,472 KB
実行使用メモリ	38,780 KB
最終ジャッジ日時	2023-10-13 18:34:13
合計ジャッジ時間	12,736 ms
ジャッジサーバーID （参考情報）	judge13 / judge14
このコードへのチャレンジ（β）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,352 KB
testcase_01	AC	1 ms 4,348 KB
testcase_02	AC	1 ms 4,352 KB
testcase_03	AC	626 ms 38,772 KB
testcase_04	AC	622 ms 38,780 KB
testcase_05	AC	634 ms 38,716 KB
testcase_06	AC	637 ms 38,668 KB
testcase_07	AC	638 ms 38,712 KB
testcase_08	AC	22 ms 4,352 KB
testcase_09	AC	383 ms 38,704 KB
testcase_10	AC	559 ms 38,724 KB
testcase_11	AC	556 ms 38,672 KB
testcase_12	AC	343 ms 36,652 KB
testcase_13	AC	366 ms 31,388 KB
testcase_14	AC	116 ms 10,692 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
#line 2 "cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)debug(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define _overload4(_1,_2,_3,_4,name,...) name
#define __rep(i,a) repi(i,0,a,1)
#define _rep(i,a,b) repi(i,a,b,1)
#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)
#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)
#define _overload3_rev(_1,_2,_3,name,...) name
#define _rep_rev(i,a) repi_rev(i,0,a)
#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)
#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)

// #define rep(i,...) for(auto i:range(__VA_ARGS__)) 
// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
// #define irep(i) for(lint i=0;;++i)
// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const string ds="DRUL";
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
#if __cplusplus>=201703L
    template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#endif
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
#define bit(n,a) ((n>>a)&1)
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
using graph=vector<vector<int>>;
template<typename T>using graph_w=vector<vector<pair<int,T>>>;
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
#if __cplusplus>=201703L
    constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}
#endif

template<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}
template<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}
template<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}
template<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}
// 128*1024*1024
#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
#define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);
#line 5 "cpplib/graph_tree/graph_template.hpp"
/**
 * @brief グラフテンプレート
 */

using graph=std::vector<std::vector<int>>;
template<typename T>
using graph_w=std::vector<std::vector<std::pair<int,T>>>;

graph load_graph(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);g[t].push_back(s);}return g;}
graph load_digraph(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);}return g;}
graph load_graph0(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);g[t].push_back(s);}return g;}
graph load_digraph0(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);}return g;}
graph load_tree(int n){graph g(n);for(int i=0;i<n-1;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);g[t].push_back(s);}return g;}
graph load_tree0(int n){graph g(n);for(int i=0;i<n-1;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);g[t].push_back(s);}return g;}
graph load_treep(int n){graph g(n);for(int i=0;i<n-1;++i){int t;std::cin>>t;g[i+1].push_back(t);g[t].push_back(i+1);}return g;}
template<typename T>graph_w<T> load_graph_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;}
template<typename T>graph_w<T> load_digraph_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);}return g;}
template<typename T>graph_w<T> load_graph0_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;}
template<typename T>graph_w<T> load_digraph0_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);}return g;}
template<typename T>graph_w<T> load_tree_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;}
template<typename T>graph_w<T> load_tree0_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;}
template<typename T>graph_w<T> load_treep_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int t;T u;std::cin>>t>>u;g[i+1].emplace_back(t,u);g[t].emplace_back(i+1,u);}return g;}
#line 3 "cpplib/alga/maybe.hpp"

/**
 * @brief Maybe
 * @see https://ja.wikipedia.org/wiki/%E3%83%A2%E3%83%8A%E3%83%89_(%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0)#Maybe%E3%83%A2%E3%83%8A%E3%83%89
 */

template<typename T>
struct maybe{
    bool _is_none;
    T val;
    maybe():_is_none(true){}
    maybe(T val):_is_none(false),val(val){}
    T unwrap()const{
        assert(!_is_none);
        return val;
    }
    T unwrap_or(T e)const{
        return _is_none?e:val;
    }
    bool is_none()const{return _is_none;}
    bool is_some()const{return !_is_none;}
};

template<typename T,typename F>
auto expand(F op){
    return [&op](const maybe<T>& __s,const maybe<T>& __t)->maybe<T>{
        if(__s.is_none())return __t;
        if(__t.is_none())return __s;
        return maybe<T>(op(__s.unwrap(),__t.unwrap()));
    };
}
#line 3 "cpplib/segment_tree/lazy_segment_tree.hpp"

template<typename T,typename E,typename F,typename G,typename H>
class lazy_segment_tree{
    using i64=long long;
    i64 n;
    i64 sz;
    struct node;
    using np=node*;
    struct node{
        maybe<T> val=maybe<T>();
        maybe<E> lazy=maybe<E>();
        np lch=nullptr,rch=nullptr;
        node(){}
    };
    np root=new node();
    maybe<T> fix(i64 a,T x,i64 l,i64 r,np t){
        auto f=expand<T,F>(_f);
        eval(t,l,r);
        //区間外
        if(r<=a||a<l)return t->val;
        //全部区間内
        if(l==a&&r==a+1){
            eval(t,l,r);
            t->val=x;
            return t->val;
        }
        //一部区間内
        return t->val=f(fix(a,x,l,(l+r)/2,t->lch),fix(a,x,(l+r)/2,r,t->rch));
    }
    maybe<T> update(i64 a,i64 b,E x,i64 l,i64 r,np t){
        auto f=expand<T,F>(_f);
        eval(t,l,r);
        //区間外
        if(r<=a||b<=l)return t->val;
        //全部区間内
        if(a<=l&&r<=b){
            t->lazy=x;
            eval(t,l,r);
            return t->val;
        }
        //一部区間内
        return t->val=f(update(a,b,x,l,(l+r)/2,t->lch),update(a,b,x,(l+r)/2,r,t->rch));
    }
    maybe<T> get(i64 a,i64 b,i64 l,i64 r,np t){
        auto f=expand<T,F>(_f);
        eval(t,l,r);
        //区間外
        if(r<=a||b<=l)return maybe<T>();
        //全部区間内
        if(a<=l&&r<=b)return t->val;
        //一部区間内
        return f(get(a,b,l,(l+r)/2,t->lch),get(a,b,(l+r)/2,r,t->rch));
    }
    void eval(np t,i64 l,i64 r){
        auto g=expand<E,G>(_g);
        if(r-l>1){
            if(!t->lch)t->lch=new node();
            if(!t->rch)t->rch=new node();
            t->lch->lazy=g(t->lch->lazy,t->lazy);
            t->rch->lazy=g(t->rch->lazy,t->lazy);
        }
        t->val=h(t->val,t->lazy,l,r);
        t->lazy=maybe<E>();
    }
    template<typename Less>
    i64 lower_bound_right(maybe<T> now,np t,Less op,i64 l,i64 r){
        auto f=expand<T,F>(_f);
        eval(t,l,r);
        if(t->lch)eval(t->lch,l,(l+r)/2);
        if(t->rch)eval(t->rch,(l+r)/2,r);
        const auto p=t->rch?f(t->rch->val,now):now;
        if(r-l==1){
            return 0;
        }
        if(!op(f(t->val,now))){
            return r-l;
        }
        if(op(p)){
            return lower_bound_right(now,t->rch,op,(l+r)/2,r);
        }else{
            return (r-l)/2+lower_bound_right(p,t->lch,op,l,(l+r)/2);
        }
    }
    F _f;G _g;H _h;
    maybe<T> h(const maybe<T>&s,const maybe<E>&t,i64 l,i64 r){
        if(t.is_none())return s;
        else return maybe<T>(_h(s,t.unwrap(),l,r));
    }
    public:
    lazy_segment_tree(i64 sz,F f=F(),G g=G(),H h=H()):n(1),sz(sz),_f(f),_g(g),_h(h){while(n<sz)n<<=1;}
    //0-indexed [a,b)
    void fix(i64 a,T x){fix(a,x,0,n,root);}
    //0-indexed [a,b)
    void update(i64 a,i64 b,E x){update(a,b,x,0,n,root);}
    //0-indexed [a,b)
    maybe<T> get(i64 a,i64 b){return get(a,b,0,n,root);}
    template<typename Less>
    i64 lower_bound_right(Less op){
        return n-lower_bound_right(maybe<T>(),root,op,0,n);
    }
};
#line 4 "cpplib/graph_tree/HLD_lazy.hpp"

template<typename T,typename E,typename F,typename G,typename H>
struct HLD_lazy{
	int child_size(const  graph& v,int n,int p){
		int cnt=0;
		for(auto t:v[n]){
			if(t!=p)cnt+=child_size(v,t,n);
		}
		return sz[n]=cnt+1;
	}
	void make(const graph& v,int root){
		sz=new int[v.size()];
		vertex=new int[v.size()];
		par=new int[v.size()];
		head=new int[v.size()];
		child_size(v,root,-1);
		stack<tuple<int,int>>stk;
		stk.emplace(root,-1);
		int idx=0;
		par[root]=root;
		head[root]=root;
		while(!stk.empty()){
			int n,p;
			tie(n,p)=stk.top();
			stk.pop();
			vertex[n]=idx++;
			int mx=0,heavy=-1;
			for(auto t:v[n])if(t!=p&&mx<sz[t]){
				mx=sz[t];
				heavy=t;
			}
			for(auto t:v[n]){
				if(t!=heavy&&t!=p){
					par[t]=n;
					head[t]=t;
					stk.emplace(t,n);
				}
			}
			if(heavy!=-1){
				par[heavy]=par[n];
				head[heavy]=head[n];
				stk.emplace(heavy,n);
			}
		}
	}
	int* sz;
	int* vertex;
	int* par;
	int* head;
	F _f;G _g;H _h;
	lazy_segment_tree<T,E,F,G,H>* seg;
	public:
	HLD_lazy(const graph& v,int root=0,F f=F(),G g=G(),H h=H()):_f(f),_g(g),_h(h){
		make(v,root);
		seg=new lazy_segment_tree<T,E,F,G,H>(v.size(),f,g,h);
	}
	// HLD_lazy(const graph& v,const vector<T>& a,int root=0,F f=F(),G g=G(),H h=H()):_f(f),_g(g),_h(h){
	// 	vector<T>tmp(v.size());
	// 	make(v,root);
	// 	for(int i=0;i<(int)v.size();i++){
	// 		tmp[vertex[i]]=a[i];
	// 	}
	// 	seg=new lazy_segment_tree(tmp,f,g,h);
	// }
	int lca(int l,int r){
		while(1){
			if(head[l]==head[r])return sz[l]>sz[r]?l:r;
			else if(sz[head[l]]>sz[head[r]])r=par[r];
			else l=par[l];
		}
	}
	inline void fix_vertex(int u,T x){
		seg->fix(vertex[u],x);
	}
	inline void update_vertex(int u,E x){
		seg->update(vertex[u],vertex[u]+1,x);
	}
	inline maybe<T> get_vertex(int u){
		return seg->get(vertex[u],vertex[u]+1);
	}
	inline void update_subtree(int u,E x){
		seg->update(vertex[u],vertex[u]+sz[u],x);
	}
	inline maybe<T> get_subtree(int u){
		return seg->get(vertex[u],vertex[u]+sz[u]);
	}
	void update_path(int u,int v,E x){
		while(1){
			if(head[u]==head[v]){
				seg->update(vertex[u],vertex[v],x);
				break;
			}
			else if(sz[head[u]]>sz[head[v]]){
				seg->update(vertex[v],vertex[head[v]],x);
				v=par[v];
			}
			else{
				seg->update(vertex[u],vertex[head[u]],x);
				u=par[u];
			}
		}
	}
	T get_path(int u,int v){
		auto f=expand<T,F>(_f);
		maybe<T> res;
		while(1){
			if(head[u]==head[v]){
				return f(res,seg->get(vertex[u],vertex[v]));
			}
			else if(sz[head[u]]>sz[head[v]]){
				res=f(res,seg->get(vertex[v],vertex[head[v]]));
				v=par[v];
			}
			else{
				res=f(res,seg->get(vertex[u],vertex[head[u]]));
				u=par[u];
			}
		}
	}
};
#line 3 "cpplib/segment_tree/dual_segment_tree.hpp"

/**
 * @brief 双対セグメント木
 */

template<typename T,typename F>
class dual_segment_tree{
	struct node;
	using np=node*;
	using i64=long long;
	struct node{
		maybe<T> val;
		np ch[2]={nullptr,nullptr};
		node(maybe<T> val=maybe<T>()):val(val){}
	};
	np root=nullptr;
	i64 n=1,sz;
    F op;
	public:
	dual_segment_tree(i64 sz,F op=F()):sz(sz),op(op){while(n<sz)n<<=1;}
	inline void fix(i64 a,T x){fix(a,x,0,n,root);}
	inline void update(i64 l,i64 r,T x){update(l,r,x,0,n,root);}
	inline maybe<T> get(i64 x){return get(x,0,n,root);}
	private:
	void eval(np& t){
        auto f=expand<T,F>(op);
		if(t->val.is_none())return;
		if(!t->ch[0])t->ch[0]=new node();
		if(!t->ch[1])t->ch[1]=new node();
		t->ch[0]->val=f(t->ch[0]->val,t->val);
		t->ch[1]->val=f(t->ch[1]->val,t->val);
		t->val=maybe<T>();
	}
	void fix(i64 a,T x,i64 l,i64 r,np& t){
        if(!t)t=new node();
		if(r-l>1)eval(t);
		if(r<=a||a<l)return;
		else if(l==a&&r==a+1)t->val=x;
	    else if(r-l>1){
			fix(a,x,l,(l+r)/2,t->ch[0]);
			fix(a,x,(l+r)/2,r,t->ch[1]);
		}
	}
	void update(i64 a,i64 b,T x,i64 l,i64 r,np& t){
        auto f=expand<T,F>(op);
        if(!t)t=new node();
		if(r-l>1)eval(t);
		if(r<=a||b<=l)return;
		else if(a<=l&&r<=b)t->val=f(t->val,x);
	    else if(r-l>1){
			update(a,b,x,l,(l+r)/2,t->ch[0]);
			update(a,b,x,(l+r)/2,r,t->ch[1]);
		}
	}
	maybe<T> get(i64 x,i64 l,i64 r,np& t){
        auto f=expand<T,F>(op);
        if(!t)t=new node();
		if(r-l>1)eval(t);
		if(x<l||r<=x)return maybe<T>();
        else if(r-l==1){
            return t->val;
        }
		else return f(get(x,l,(l+r)/2,t->ch[0]),get(x,(l+r)/2,r,t->ch[1]));
	}
};
#line 4 "main.cpp"
int main(){
    auto f=[&](auto s,auto t){
        return s^t;
    };
    auto g=[&](auto s,auto t){
        return s||t;
    };
    auto h=[&](auto s,auto t,auto l,auto r)->lint{
        if(t)return 0;
        return s.unwrap_or(0);
    };
    lint n;
    cin>>n;
    vector<vector<pair<lint,lint>>>gg(n);
    graph v(n);
    rep(i,n-1){
        lint s,t,u;
        cin>>s>>t>>u;
        s--;t--;
        gg[s].emplace_back(t,u);
        gg[t].emplace_back(s,u);
        v[s].emplace_back(t);
        v[t].emplace_back(s);
    }
    vec cnt(n),pp(n),cnt2(n);
    auto dfs=[&](auto dfs,lint now,lint p)->void{
        for(auto [e,c]:gg[now]){
            if(e==p)continue;
            cnt[now]^=c;
            cnt2[e]=c;
            pp[e]=now;
            dfs(dfs,e,now);
        }
    };
    auto f2=[&](auto s,auto t){
        return s&&t;
    };
    dfs(dfs,0,-1);
    HLD_lazy<lint,bool,decltype(f),decltype(g),decltype(h)>hld(v,0,f,g,h);
    dual_segment_tree<lint,decltype(f2)>st(n,f2);
    rep(i,n){
        hld.fix_vertex(i,cnt[i]);
    }
    lint q;
    cin>>q;
    rep(i,n)st.fix(i,1);
    while(q--){
        lint t,x;
        cin>>t>>x;
        x--;
        if(t==1){
            bool b=st.get(hld.vertex[x]).unwrap_or(0);
            hld.update_subtree(x,1);
            st.update(hld.vertex[x],hld.vertex[x]+hld.sz[x],0);
            if(pp[x]!=-1&&b){
                hld.fix_vertex(pp[x],hld.get_vertex(pp[x]).unwrap_or(0)^cnt2[x]);
            }
        }else{
            cout<<hld.get_subtree(x).unwrap_or(0)<<endl;
            // cout<<hld.seg->get(hld.vertex[x]+1,hld.vertex[x]+hld.sz[x]).unwrap_or(0)<<endl;
        }
    }
}
yukicoder

結果

テストケース

ソースコード
