結果
問題 | No.1982 [Cherry 4th Tune B] 絶険 |
ユーザー |
👑 ![]() |
提出日時 | 2022-05-27 00:55:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 647 ms / 3,000 ms |
コード長 | 4,345 bytes |
コンパイル時間 | 2,478 ms |
コンパイル使用メモリ | 208,264 KB |
最終ジャッジ日時 | 2025-01-29 15:25:37 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 35 |
ソースコード
#include <bits/stdc++.h>using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;ll ILL=2167167167167167167;const int INF=2100000000;const ll mod=998244353;#define rep(i,a) for (ll i=0;i<a;i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}namespace po167{template <class T,T (*op)(T,T),T(*e)()>struct segment_tree{int _n,size;std::vector<T> seg;int ceil_pow2(int a){int b=1;while(a>b){b<<=1;}return b;}void update(int k){seg[k]=op(seg[k*2],seg[k*2+1]);};segment_tree(int n) :_n(n){size=ceil_pow2(n);seg=std::vector<T>(size*2,e());}segment_tree(std::vector<T> &p) :_n((int) p.size()){size=ceil_pow2(_n);seg=std::vector<T>(size*2,e());for(int i=0;i<_n;i++) seg[i+size]=p[i];for(int i=size-1;i>0;i--) update(i);}void set(int ind,T val){assert(0<=ind&&ind<_n);ind+=size;seg[ind]=val;while(ind!=1){ind>>=1;update(ind);}}void addl(int ind,T val){set(ind,op(get(ind),val));}void addr(int ind,T val){set(ind,op(val,get(ind)));}T get(int ind){assert(0<=ind&&ind<_n);return seg[ind+size];}T query(int l,int r){assert(0<=l&&l<=r&&r<=_n);T l_val=e();T r_val=e();l+=size,r+=size;while(l<r){if(l&1) l_val=op(l_val,seg[l]),l+=1;if(r&1) r-=1,r_val=op(seg[r],r_val);r>>=1;l>>=1;}return op(l_val,r_val);}template <bool (*f)(T)> int max_right(int l) {return max_right(l, [](T x) { return f(x); });}template <class F> int max_right(int l, F f) {assert(0<=l&&l<=_n);assert(f(e()));if(f(query(l,_n))) return _n;T val=e();l+=size;while(true){while(l%2==0) l>>=1;if(!f(op(val,seg[l]))){while(l<size){l*=2;if(f(op(val,seg[l]))){val=op(val,seg[l]);l++;}}return l-size;}val=op(val,seg[l]);l++;}}template <bool (*f)(T)> int min_left(int r) {return min_left(r, [](T x) { return f(x); });}template <class F> int min_left(int r, F f) {assert(0 <= r && r <= _n);assert(f(e()));if (r == 0) return 0;r += size;T sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!f(op(seg[r], sm))) {while (r < size) {r = (2 * r + 1);if (f(op(seg[r], sm))) {sm = op(seg[r], sm);r--;}}return r + 1 - size;}sm = op(seg[r], sm);} while ((r & -r) != r);return 0;}};}using po167::segment_tree;using F= ll;F op(F a,F b){return a+b;}F e(){return 0;}ll target;bool f(F x){return x<target;}void solve();// ソンナコトナイヨint main() {int t=1;//cin>>t;rep(i,t) solve();}void solve(){int N,K,Q;cin>>N>>K>>Q;vector<vector<pair<int,ll>>> add(N+1);vector<int> C(K);segment_tree<F,op,e> seg(K);rep(i,K){ll l,r,h;cin>>l>>r>>C[i]>>h;add[l-1].push_back({i,h});add[r].push_back({i,-h});}vector<int> ans(Q),order(Q),I(Q);vector<ll> X(Q);rep(i,Q){order[i]=i;cin>>I[i]>>X[i];I[i]--;}int front=0;sort(all(order),[&](int l,int r){return I[l]<I[r];});rep(i,Q){int a=order[i];while(front<=I[a]){for(auto x:add[front]){seg.addl(x.first,x.second);}front++;}target=X[a];int r=seg.max_right<f>(0);if(r==K) ans[a]=-1;else ans[a]=C[r];}rep(i,Q) cout<<ans[i]<<"\n";}