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=2359 #include<bits/stdc++.h> using namespace std; #define call_from_test #include "../../tools/drop.cpp" #include "../../vector/compress.cpp" #include "../../vector/fusion.cpp" #include "../../vector/near.cpp" #include "../../segtree/basic/dual.cpp" #define SegmentTree SegmentTree2 #include "../../segtree/basic/lazy.cpp" #undef SegmentTree #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); int q; cin>>q; vector<int> ts(q),as(q),bs(q),ys(q); for(int i=0;i<q;i++) cin>>ts[i]>>as[i]>>bs[i]>>ys[i]; vector<int> vs=near(fusion(as,bs),-1,0,1); vs.emplace_back(0); vs.emplace_back(1e9+10); vs=compress(vs); auto dc=dict(vs); int m=dc.size(); using P = pair<int, int>; auto h=[&](P a,P b){ if(a.first) return a; return P(b.first,max(a.second,b.second)); }; P ei(0,0); SegmentTree<P> seg(h,ei); seg.init(m); for(int i=0;i<q;i++){ int l=dc[as[i]]; int r=dc[bs[i]+1]; if(ts[i]==0) seg.update(l,r,P(0,ys[i])); if(ts[i]==1) seg.update(l,r,P(1,0)); } vector<int> zs(m); for(int i=0;i<m;i++) zs[i]=seg.get_val(i).second; auto ff=[&](int a,int b){return min(a,b);}; auto gg=[&](int ,int b){return b;}; SegmentTree2<int, int> seg2(ff,gg,gg,INT_MAX,-1); seg2.build(zs); for(int i=0;i<q;i++){ int l=dc[as[i]]; int r=dc[bs[i]+1]; if(ts[i]==0){ if(seg2.query(l,r)!=ys[i]) drop("NO"); } if(ts[i]==1){ seg2.update(l,r,ys[i]); } } drop("YES"); return 0; }
#line 1 "test/aoj/2359.test.cpp" // verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2359 #include<bits/stdc++.h> using namespace std; #define call_from_test #line 1 "tools/drop.cpp" #line 3 "tools/drop.cpp" using namespace std; #endif //BEGIN CUT HERE template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);} //END CUT HERE #ifndef call_from_test //INSERT ABOVE HERE signed main(){ return 0; } #endif #line 1 "vector/compress.cpp" #line 3 "vector/compress.cpp" using namespace std; #endif //BEGIN CUT HERE template<typename V> V compress(V vs){ sort(vs.begin(),vs.end()); vs.erase(unique(vs.begin(),vs.end()),vs.end()); return vs; } template<typename T> map<T, int> dict(const vector<T> &vs){ map<T, int> res; for(int i=0;i<(int)vs.size();i++) res[vs[i]]=i; return res; } map<char, int> dict(const string &s){ return dict(vector<char>(s.begin(),s.end())); } template<typename T> vector<T> compressed(vector<T> vs){ auto dc=dict(compress(vs)); for(auto &v:vs) v=dc[v]; return vs; } //END CUT HERE #ifndef call_from_test //INSERT ABOVE HERE signed main(){ return 0; } #endif #line 1 "vector/fusion.cpp" #line 3 "vector/fusion.cpp" using namespace std; #endif //BEGIN CUT HERE template<typename T, typename ...Ts> vector<T> fusion(vector<T> bs,Ts... ts){ auto append=[&](auto vs){for(auto v:vs) bs.emplace_back(v);}; initializer_list<int>{(void(append(ts)),0)...}; return bs; } //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif #line 1 "vector/near.cpp" #line 3 "vector/near.cpp" using namespace std; #endif //BEGIN CUT HERE template<typename T> vector<T> add(vector<T> vs,vector<T> as){ assert(vs.size()==as.size()); for(int i=0;i<(int)vs.size();i++) vs[i]+=as[i]; return vs; } template<typename T, typename U> vector<T> add(vector<T> vs,U a){ return add(vs,vector<T>(vs.size(),a)); } template<typename T> vector<T> mul(vector<T> vs,vector<T> as){ assert(vs.size()==as.size()); for(int i=0;i<(int)vs.size();i++) vs[i]*=as[i]; return vs; } template<typename T, typename U> vector<T> mul(vector<T> vs,U a){ return mul(vs,vector<T>(vs.size(),a)); } template<typename T, typename ...Ts> vector<T> near(vector<T> vs,Ts... ts){ vector<T> rs; rs.reserve(vs.size()*sizeof...(ts)); auto append=[&](auto a){ for(auto w:add(vs,a)) rs.emplace_back(w); }; initializer_list<int>{(void(append(ts)),0)...}; return rs; } //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif #line 1 "segtree/basic/dual.cpp" #line 3 "segtree/basic/dual.cpp" using namespace std; #endif //BEGIN CUT HERE template <typename E> struct SegmentTree{ using H = function<E(E,E)>; int n,height; H h; E ei; vector<E> laz; SegmentTree(H h,E ei):h(h),ei(ei){} void init(int n_){ n=1;height=0; while(n<n_) n<<=1,height++; laz.assign(2*n,ei); } 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]); laz[k]=ei; } inline void thrust(int k){ for(int i=height;i;i--) propagate(k>>i); } 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); } } E get_val(int a){ thrust(a+=n); return laz[a]; } void set_val(int a,E x){ thrust(a+=n); laz[a]=x; } }; //END CUT HERE #ifndef call_from_test //INSERT ABOVE HERE signed main(){ return 0; } #endif #line 12 "test/aoj/2359.test.cpp" #define SegmentTree SegmentTree2 #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 14 "test/aoj/2359.test.cpp" #undef SegmentTree #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); int q; cin>>q; vector<int> ts(q),as(q),bs(q),ys(q); for(int i=0;i<q;i++) cin>>ts[i]>>as[i]>>bs[i]>>ys[i]; vector<int> vs=near(fusion(as,bs),-1,0,1); vs.emplace_back(0); vs.emplace_back(1e9+10); vs=compress(vs); auto dc=dict(vs); int m=dc.size(); using P = pair<int, int>; auto h=[&](P a,P b){ if(a.first) return a; return P(b.first,max(a.second,b.second)); }; P ei(0,0); SegmentTree<P> seg(h,ei); seg.init(m); for(int i=0;i<q;i++){ int l=dc[as[i]]; int r=dc[bs[i]+1]; if(ts[i]==0) seg.update(l,r,P(0,ys[i])); if(ts[i]==1) seg.update(l,r,P(1,0)); } vector<int> zs(m); for(int i=0;i<m;i++) zs[i]=seg.get_val(i).second; auto ff=[&](int a,int b){return min(a,b);}; auto gg=[&](int ,int b){return b;}; SegmentTree2<int, int> seg2(ff,gg,gg,INT_MAX,-1); seg2.build(zs); for(int i=0;i<q;i++){ int l=dc[as[i]]; int r=dc[bs[i]+1]; if(ts[i]==0){ if(seg2.query(l,r)!=ys[i]) drop("NO"); } if(ts[i]==1){ seg2.update(l,r,ys[i]); } } drop("YES"); return 0; }