#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D" #include "../dual_segment_tree.hpp" #include "../../functional/update.hpp" #include "../../util/template.hpp" int main(){ lint n,q; cin>>n>>q; dual_segment_tree<lint,update<lint>>seg(n); while(q--){ lint c; cin>>c; if(c==0){ lint s,t,u; cin>>s>>t>>u; seg.update(s,t+1,u); }else{ lint x; cin>>x; cout<<seg.get(x).unwrap_or((1LL<<31)-1)<<endl; } } }
#line 1 "segment_tree/test/AOJ_dual_segment_tree.test.cpp" #define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D" #line 2 "alga/maybe.hpp" #include<cassert> /** * @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){ if(s.is_none())return t; if(t.is_none())return s; return maybe<T>(op(s.unwrap(),t.unwrap())); }; } #line 3 "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 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 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 2 "functional/update.hpp" /** * @brief 更新 */ template<typename T> struct update{ T operator()(const T& s,const T& t){ return t; } }; #line 2 "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)output(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 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) 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...));} #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;} constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;} #line 5 "segment_tree/test/AOJ_dual_segment_tree.test.cpp" int main(){ lint n,q; cin>>n>>q; dual_segment_tree<lint,update<lint>>seg(n); while(q--){ lint c; cin>>c; if(c==0){ lint s,t,u; cin>>s>>t>>u; seg.update(s,t+1,u); }else{ lint x; cin>>x; cout<<seg.get(x).unwrap_or((1LL<<31)-1)<<endl; } } }