結果
問題 | No.1270 Range Arrange Query |
ユーザー |
👑 ![]() |
提出日時 | 2023-04-14 18:49:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 12,881 bytes |
コンパイル時間 | 3,321 ms |
コンパイル使用メモリ | 237,900 KB |
最終ジャッジ日時 | 2025-02-12 06:12:50 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 9 TLE * 6 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")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 int mod=998244353;#define rep(i,a,b) for (ll i=a;i<b;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";}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}namespace atcoder {namespace internal {// @param n `0 <= n`// @return minimum non-negative `x` s.t. `n <= 2**x`int ceil_pow2(int n) {int x = 0;while ((1U << x) < (unsigned int)(n)) x++;return x;}// @param n `1 <= n`// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`int bsf(unsigned int n) {#ifdef _MSC_VERunsigned long index;_BitScanForward(&index, n);return index;#elsereturn __builtin_ctz(n);#endif}} // namespace internaltemplate <class S,S (*op)(S, S),S (*e)(),class F,S (*mapping)(F, S),F (*composition)(F, F),F (*id)()>struct lazy_segtree {public:lazy_segtree() : lazy_segtree(0) {}lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {log = internal::ceil_pow2(_n);size = 1 << log;d = std::vector<S>(2 * size, e());lz = std::vector<F>(size, id());for (int i = 0; i < _n; i++) d[size + i] = v[i];for (int i = size - 1; i >= 1; i--) {update(i);}}void set(int p, S x) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);d[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}S get(int p) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);return d[p];}S prod(int l, int r) {assert(0 <= l && l <= r && r <= _n);if (l == r) return e();l += size;r += size;for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push(r >> i);}S sml = e(), smr = e();while (l < r) {if (l & 1) sml = op(sml, d[l++]);if (r & 1) smr = op(d[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}S all_prod() { return d[1]; }void apply(int p, F f) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);d[p] = mapping(f, d[p]);for (int i = 1; i <= log; i++) update(p >> i);}void apply(int l, int r, F f) {assert(0 <= l && l <= r && r <= _n);if (l == r) return;l += size;r += size;for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push((r - 1) >> i);}{int l2 = l, r2 = r;while (l < r) {if (l & 1) all_apply(l++, f);if (r & 1) all_apply(--r, f);l >>= 1;r >>= 1;}l = l2;r = r2;}for (int i = 1; i <= log; i++) {if (((l >> i) << i) != l) update(l >> i);if (((r >> i) << i) != r) update((r - 1) >> i);}}template <bool (*g)(S)> int max_right(int l) {return max_right(l, [](S x) { return g(x); });}template <class G> int max_right(int l, G g) {assert(0 <= l && l <= _n);assert(g(e()));if (l == _n) return _n;l += size;for (int i = log; i >= 1; i--) push(l >> i);S sm = e();do {while (l % 2 == 0) l >>= 1;if (!g(op(sm, d[l]))) {while (l < size) {push(l);l = (2 * l);if (g(op(sm, d[l]))) {sm = op(sm, d[l]);l++;}}return l - size;}sm = op(sm, d[l]);l++;} while ((l & -l) != l);return _n;}template <bool (*g)(S)> int min_left(int r) {return min_left(r, [](S x) { return g(x); });}template <class G> int min_left(int r, G g) {assert(0 <= r && r <= _n);assert(g(e()));if (r == 0) return 0;r += size;for (int i = log; i >= 1; i--) push((r - 1) >> i);S sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!g(op(d[r], sm))) {while (r < size) {push(r);r = (2 * r + 1);if (g(op(d[r], sm))) {sm = op(d[r], sm);r--;}}return r + 1 - size;}sm = op(d[r], sm);} while ((r & -r) != r);return 0;}private:int _n, size, log;std::vector<S> d;std::vector<F> lz;void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }void all_apply(int k, F f) {d[k] = mapping(f, d[k]);if (k < size) lz[k] = composition(f, lz[k]);}void push(int k) {all_apply(2 * k, lz[k]);all_apply(2 * k + 1, lz[k]);lz[k] = id();}};} // namespace atcoderusing namespace atcoder;using lazy_S = int;using lazy_F = int;lazy_S lazy_op(lazy_S l, lazy_S r) {return min(l,r);}lazy_S lazy_e() { return INF; }lazy_S mapping(lazy_F l, lazy_S r) {return l+r;}//l(r(x))lazy_F composition(lazy_F l, lazy_F r) {return l+r;}lazy_F lazy_id(){return 0;}#define lazy_calc lazy_S,lazy_op,lazy_e,lazy_F,mapping,composition,lazy_idnamespace atcoder {template <class S, S (*op)(S, S), S (*e)()> struct segtree {public:segtree() : segtree(0) {}segtree(int n) : segtree(std::vector<S>(n, e())) {}segtree(const std::vector<S>& v) : _n(int(v.size())) {log = internal::ceil_pow2(_n);size = 1 << log;d = std::vector<S>(2 * size, e());for (int i = 0; i < _n; i++) d[size + i] = v[i];for (int i = size - 1; i >= 1; i--) {update(i);}}void set(int p, S x) {assert(0 <= p && p < _n);p += size;d[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}S get(int p) {assert(0 <= p && p < _n);return d[p + size];}S prod(int l, int r) {assert(0 <= l && l <= r && r <= _n);S sml = e(), smr = e();l += size;r += size;while (l < r) {if (l & 1) sml = op(sml, d[l++]);if (r & 1) smr = op(d[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}S all_prod() { return d[1]; }template <bool (*f)(S)> int max_right(int l) {return max_right(l, [](S x) { return f(x); });}template <class F> int max_right(int l, F f) {assert(0 <= l && l <= _n);assert(f(e()));if (l == _n) return _n;l += size;S sm = e();do {while (l % 2 == 0) l >>= 1;if (!f(op(sm, d[l]))) {while (l < size) {l = (2 * l);if (f(op(sm, d[l]))) {sm = op(sm, d[l]);l++;}}return l - size;}sm = op(sm, d[l]);l++;} while ((l & -l) != l);return _n;}template <bool (*f)(S)> int min_left(int r) {return min_left(r, [](S 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;S sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!f(op(d[r], sm))) {while (r < size) {r = (2 * r + 1);if (f(op(d[r], sm))) {sm = op(d[r], sm);r--;}}return r + 1 - size;}sm = op(d[r], sm);} while ((r & -r) != r);return 0;}private:int _n, size, log;std::vector<S> d;void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }};} // namespace atcoderusing namespace atcoder;using F= ll;F op(F a,F b){return a+b;}F e(){return 0;}namespace po167{template<class ADD,class DEL>struct Mo{std::vector<int> left,right,order;int width,nl,nr,index,_n;ADD add;DEL del;Mo(int n,ADD add,DEL del):width((int) std::sqrt(n)),nl(0),nr(0),index(0),_n(0),add(add),del(del){}//[l,r)void insert(int l,int r){assert(l<=r);left.push_back(l);right.push_back(r);}void bulid(){width=(int)((double)_n/std::max((double)1,sqrt((int)(left.size()))));width=max(1,width);order.resize((int)left.size());std::vector<int> order1((int)left.size());std::iota(order1.begin(),order1.end(),0);auto order2=order1;std::sort(order1.begin(),order1.end(),[&](int a,int b){if(left[a]/width!=left[b]/width){return left[a]>left[b];}else if((left[a]/width)&1){return right[a]<right[b];}return right[a]>right[b];});std::sort(order2.begin(),order2.end(),[&](int a,int b){if((width/2+left[a])/width!=(width/2+left[b])/width){return left[a]>left[b];}else if(((width/2+left[a])/width)&1){return right[a]<right[b];}return right[a]>right[b];});int score1=0,score2=0;for(int i=1;i<(int)(left.size());i++){score1+=std::abs(left[order1[i]]-left[order1[i-1]]);score1+=std::abs(right[order1[i]]-right[order1[i-1]]);score2+=std::abs(left[order2[i]]-left[order2[i-1]]);score2+=std::abs(right[order2[i]]-right[order2[i-1]]);}if(score1<score2) order=order1;else order=order2;}int process(){int now=order[index];while(nr<right[now]) add(nr),nr++;while(nl>left[now]) nl--,add(nl);while(nl<left[now]) del(nl),nl++;while(nr>right[now]) nr--,del(nr);index++;return now;}};}using po167::Mo;void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){int N,Q;cin>>N>>Q;vector<int> A(N);rep(i,0,N) cin>>A[i],A[i]--;int ans=0;int L=N;lazy_segtree<lazy_calc> laseg(N);segtree<F,op,e> seg1(N),seg2(N);rep(i,0,N) laseg.set(i,0);auto add=[&](int a)->void{//cout<<"+ "<<a<<" "<<ans<<" "<<L<<endl;ans-=seg1.prod(0,A[a]);ans-=seg2.prod(A[a]+1,N);if(L==a){seg1.set(A[a],seg1.get(A[a])-1);laseg.apply(A[a]+1,N,-1);L++;}else{seg2.set(A[a],seg2.get(A[a])-1);laseg.apply(0,A[a],-1);}};auto del=[&](int a)->void{//cout<<"- "<<a<<" "<<ans<<" "<<L<<endl;ans+=seg1.prod(0,A[a]);ans+=seg2.prod(A[a]+1,N);if(L==a+1){seg1.set(A[a],seg1.get(A[a])+1);laseg.apply(1+A[a],N,1);L--;}else{seg2.set(A[a],seg2.get(A[a])+1);laseg.apply(0,A[a],1);}};for(int i=N-1;i>=0;i--) del(i);Mo M(N,add,del);rep(i,0,Q){int a,b;cin>>a>>b;M.insert(a-1,b);}M.bulid();vector<int> out(Q);rep(i,0,Q){int a=M.process();/*rep(j,0,N){cout<<laseg.get(i)<<" ";}cout<<endl;cout<<ans<<" "<<a<<endl;*/out[a]=ans+laseg.all_prod()*(M.nr-M.nl);}rep(i,0,Q) cout<<out[i]<<"\n";}