結果
| 問題 | No.2650 [Cherry 6th Tune *] セイジャク |
| ユーザー |
 mikam
|
| 提出日時 | 2024-02-23 21:41:20 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 947 ms / 2,500 ms |
| コード長 | 8,630 bytes |
| コンパイル時間 | 9,213 ms |
| コンパイル使用メモリ | 421,572 KB |
| 最終ジャッジ日時 | 2025-02-19 19:37:37 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 31 |
ソースコード
#include <atcoder/all>using namespace atcoder;#include <atcoder/internal_math>using namespace internal;#include <bits/stdc++.h>using namespace std;#include <boost/multiprecision/cpp_int.hpp>#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)#define all(v) v.begin(),v.end()#define inc(x,l,r) ((l)<=(x)&&(x)<(r))#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())#define pcnt __builtin_popcountll#define pb push_backtypedef long long ll;#define int llusing ld = long double;using vi = vector<int>;using vs = vector<string>;using P = pair<int,int>;using vp = vector<P>;using ull = unsigned long long;using Bint = boost::multiprecision::cpp_int;template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}template<class... T> void input(T&... a){(cin>> ... >> a);}#ifdef LOCALtemplate<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return0;}#elsetemplate<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}template<class T> int print(T& a){cout << a<< '\n';return 0;}template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}#endif#define VI(v,n) vi v(n); input(v)#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)int sign(ll x){return x>0?1:x<0?-1:0;}ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}ll abs(ll x,ll y){return abs(x-y);}ll bit(int n){return 1ll<<n;}template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;}P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}int takao(bool takahashi){return yesno(takahashi,"Takahashi","Aoki");}struct __m___m__ {__m___m__(){cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);}} _m_m_;int di[]={0,1,0,-1,-1,-1,1,1};int dj[]={1,0,-1,0,-1,1,-1,1};const ll INF = 8e18;//using mint = modint1000000007;using mint = modint998244353;//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}template <class S,S (*op)(S, S),S (*e)(),class F,S (*mapping)(F, S, ll, ll),F (*composition)(F, F),F (*id)()>struct dynamic_lazy_segtree{private:ll n;struct node{ll lx, rx;node *l, *r;S d;F lz;node(ll lx, ll rx, S val): lx(lx), rx(rx),l(nullptr), r(nullptr), d(val), lz(id()){}};node *root;node *make_node(ll lx, ll rx, S val = e()){return new node(lx, rx, val);}void all_apply(node *v, F x){v->d = mapping(x, v->d, v->lx, v->rx);v->lz = composition(x, v->lz);}void push(node *v){if(v->lz == id()) return;ll mid = (v->lx + v->rx) >> 1;if(!v->l) v->l = make_node(v->lx, mid);if(!v->r) v->r = make_node(mid, v->rx);all_apply(v->l, v->lz);all_apply(v->r, v->lz);v->lz = id();}S set(node *v, ll k, S x){if(v->rx - v->lx == 1) return v->d = x;push(v);ll mid = (v->lx + v->rx) >> 1;if(mid <= k){if(!v->r) v->r = make_node(mid, v->rx);if(!v->l) return v->d = set(v->r, k, x);else return v->d = op(v->l->d, set(v->r, k, x));}else{if(!v->l) v->l = make_node(v->lx, mid);if(!v->r) return v->d = set(v->l, k, x);else return v->d = op(set(v->l, k, x), v->r->d);}}S get(node *v, ll k){if(!v) return e();if(v->rx - v->lx == 1) return v->d;push(v);ll mid = (v->lx + v->rx) >> 1;if(mid <= k) return get(v->r, k);else return get(v->l, k);}S update(node *v, ll l, ll r, F x){if(r <= v->lx || v->rx <= l) return v->d;if(l <= v->lx && v->rx <= r){all_apply(v, x);return v->d;}push(v);ll mid = (v->lx + v->rx) >> 1;if(!v->l) v->l = make_node(v->lx, mid);if(!v->r) v->r = make_node(mid, v->rx);return v->d = op(update(v->l, l, r, x), update(v->r, l, r, x));}S prod(node *v, ll l, ll r){if(!v || r <= v->lx || v->rx <= l) return e();if(l <= v->lx && v->rx <= r) return v->d;push(v);return op(prod(v->l, l, r), prod(v->r, l, r));}template<typename G> ll max_right(node *v, const ll l, const G &g, S &p){if(v->rx <= l) return n;push(v);if(l <= v->lx){S m = op(p, v->d);if(g(m)) {p = op(p, v->d);return n;}if(v->rx - v->lx == 1) return v->rx;}ll res = n;if(v->l) res = max_right(v->l, l, g, p);if(res != n) return res;if(v->r) res = max_right(v->r, l, g, p);return res;}template<typename G> ll min_left(node *v, const ll r, const G &g, S &p){if(r < v->lx) return 0;push(v);if(v->rx <= r + 1){S m = op(v->d, p);if(g(m)) {p = op(v->d,p);return 0;}if(v->rx - v->lx == 1) return v->rx;}ll res = 0;if(v->r) res = min_left(v->r, r, g, p);if(res != 0) return res;if(v->l) res = min_left(v->l, r, g, p);return res;}public:dynamic_lazy_segtree(): root(nullptr),n(0){}dynamic_lazy_segtree(ll n):n(n){root = make_node(0, n);}void set(ll k, S x){assert(root);set(root, k, x);}S get(ll k){assert(root);return get(root, k);}void apply(ll l, ll r, F x){assert(root);assert(0<=l && l<=r &&r<=n);update(root, l, r, x);}S prod(ll l, ll r){assert(root);assert(0<=l && l<=r &&r<=n);return prod(root, l, r);}S all_prod(){assert(root);return root->d;}template<typename G>ll max_right(ll l, const G &g){assert(root && 0 <= l && l < n);auto p = e();assert(g(p));return max_right(root, l, g, p);}template<typename G>ll min_left(ll r, const G &g){--r;assert(root && 0 <= r && r < n);auto p = e();assert(g(p));return min_left(root, r, g, p);}};using S = long long;using F = long long;S op(S a, S b){return max(a,b);}S e(){return -1;}F id(){return -1;}S mapping(F x, S s, ll l, ll r){return max(x,s);}F composition(F a, F b){return max(a,b);}signed main() {INT(n,a);vi x(n);cin>>x;dynamic_lazy_segtree<S,op,e,F,mapping,composition,id> seg(1e9+1);INT(t);rep(i,t){INT(l,r);seg.apply(l,++r,i+1);}rep(i,n)print(seg.get(x[i]));return 0;}