結果
| 問題 | No.833 かっこいい電車 |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2019-05-24 23:50:32 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 145 ms / 2,000 ms |
| コード長 | 6,129 bytes |
| コンパイル時間 | 1,373 ms |
| コンパイル使用メモリ | 138,000 KB |
| 最終ジャッジ日時 | 2025-01-07 04:03:21 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 30 |
ソースコード
#include <iostream>#include <vector>#include <cstdio>#include <sstream>#include <map>#include <string>#include <algorithm>#include <queue>#include <cmath>#include <functional>#include <set>#include <ctime>#include <random>#include <chrono>#include <cassert>#include <tuple>#include <utility>using namespace std;namespace {using Integer = long long; //__int128;template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}template<class T> istream& operator , (istream& is, T& val){ return is >> val;}template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":""); return os;}template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;}template<class H> void print(const H& head){ cout << head; }template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }template<class H> void eprint(const H& head){ cerr << head; }template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v),step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ?val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ returnrange_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } };inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexedmt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss <<v[i]; } return ss.str(); }inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }}constexpr long long mod = 9_ten + 7;template<class T>class segment_tree{vector<T> v;int len;int parent(int pos){return (pos-1)>>1;}int l_ch(int pos){return (pos<<1) + 1;}int r_ch(int pos){return (pos<<1) + 2;}public:segment_tree(int size):len(1){while(len<=size) len<<=1;v.resize(len*2, T());}void set_value(int pos, int value){pos += len - 1;v[pos] = value;pos = parent(pos);while(1){v[pos] = v[l_ch(pos)] + v[r_ch(pos)];pos = parent(pos);if(pos==0) break;}}void set_range(int l,int r, T val, int lb,int ub,int pos){if(r<=lb || ub<=l) return;if(l<=lb && ub<=r){v[pos] = v[pos] + val; // <- ********************return;}set_range(l,r,val, lb,(lb+ub)>>1, l_ch(pos));set_range(l,r,val, (lb+ub)>>1,ub, r_ch(pos));v[pos] = v[l_ch(pos)] + v[r_ch(pos)]; // <- ********************}//[l,r)void set_range(int l,int r, T val){set_range(l,r,val, 0,len, 0);}T get_range(int l,int r, int lb,int ub,int pos){if(r<=lb || ub<=l) return T();if(l<=lb && ub<=r){return v[pos];}T l_val = get_range(l,r,lb,(lb+ub)>>1, l_ch(pos));T r_val = get_range(l,r,(lb+ub)>>1,ub, r_ch(pos));return l_val+r_val; // <- ********************}//[l,r)T get_range(int l, int r){return get_range(l,r, 0,len, 0);}};int main(){int n,q;cin >> n,q;vector<long long> a(n);cin >> a;vector<pair<int,long long>> p(q);cin >> p;segment_tree<long long> seg(n);for(int i=0; i<n; i++){seg.set_value(i, a[i]);}set<pair<int,int>> chain;{vector<pair<int,int>> v(n);for(int i=0; i<n; i++){v[i] = {i, i+1};}chain = set<pair<int,int>>(v.begin(), v.end());}for(auto w: p){int t, x;tie(t, x) = w;x--;if(t == 1){auto itr_r = chain.upper_bound(pair<int,int>{x+1, -1});auto itr_l = prev(itr_r);if(itr_l->second > x+1) continue;pair<int,int> new_chain = *itr_l;new_chain.second = itr_r -> second;chain.erase(itr_l);chain.erase(itr_r);chain.insert(new_chain);}else if(t == 2){auto itr = prev(chain.upper_bound(pair<int,int>{x+1, -1}));if(itr->second <= x+1) continue;pair<int,int> new_chain_l = *itr;pair<int,int> new_chain_r = *itr;new_chain_l.second = x+1;new_chain_r.first = x+1;chain.erase(itr);chain.insert(new_chain_l);chain.insert(new_chain_r);}else if(t == 3){a[x]++;seg.set_value(x, a[x]);}else if(t == 4){auto itr = prev(chain.upper_bound(pair<int,int>{x+1, -1}));int l,r;tie(l,r) = *itr;long long ans = seg.get_range(l,r);// eprintln("range :", l,r);println(ans);}}return 0;}