結果

問題 No.876 Range Compress Query
ユーザー ningenMeningenMe
提出日時 2019-09-06 21:56:52
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 475 ms / 2,000 ms
コード長 5,486 bytes
コンパイル時間 1,739 ms
コンパイル使用メモリ 176,208 KB
実行使用メモリ 12,092 KB
最終ジャッジ日時 2023-09-06 23:44:01
合計ジャッジ時間 6,441 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 4 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 3 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 3 ms
4,376 KB
testcase_06 AC 3 ms
4,376 KB
testcase_07 AC 3 ms
4,380 KB
testcase_08 AC 3 ms
4,376 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 3 ms
4,376 KB
testcase_11 AC 442 ms
11,816 KB
testcase_12 AC 363 ms
11,848 KB
testcase_13 AC 377 ms
11,888 KB
testcase_14 AC 459 ms
11,824 KB
testcase_15 AC 323 ms
12,092 KB
testcase_16 AC 449 ms
12,040 KB
testcase_17 AC 448 ms
11,988 KB
testcase_18 AC 475 ms
12,056 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}


template<class T> class Lazy_Segment_Tree_Range_Sum_Query {
 	size_t N, M;
	T ini;
	vector<T> node,lazy;

public:
    Lazy_Segment_Tree_Range_Sum_Query(const vector<T> & ar, const T ini) : M(ar.size()),ini(ini){
        for (N = 1; N < M; N *= 2);
        node.resize(2 * N - 1, ini);
        lazy.resize(2 * N - 1, ini);
		for (int i = 0; i<M; ++i) node[i + N - 1] = ar[i];
		for (int i = N - 2; i >= 0; --i) node[i] = node[2 * i + 1]+node[2 * i + 2];
    }

	Lazy_Segment_Tree_Range_Sum_Query(const size_t M, const T ini) : M(M),ini(ini){
        for (N = 1; N < M; N *= 2);
        node.resize(2 * N - 1, ini);
        lazy.resize(2 * N - 1, ini);
    }

    void eval(int k, int l, int r) {
		node[k] += lazy[k];
		if(r - l > 1) lazy[2*k+1] += lazy[k] / 2;
		if(r - l > 1) lazy[2*k+2] += lazy[k] / 2;
		lazy[k] = ini;
    }

    void update(int a, int b, T x, int k=0, int l=0, int r=-1) {
        if(r < 0) r = N;
        eval(k, l, r);
        if(b <= l || r <= a) return;
        if(a <= l && r <= b) {
            lazy[k] += (r - l) * x;
            eval(k, l, r);
        }
        else {
            update(a, b, x, 2*k+1, l, (l+r)/2);
            update(a, b, x, 2*k+2, (l+r)/2, r);
            node[k] = node[2*k+1] + node[2*k+2];
        }
    }

    T getvar(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = N;
        eval(k, l, r);
        if(b <= l || r <= a) return 0;
        if(a <= l && r <= b) return node[k];
        T vl = getvar(a, b, 2*k+1, l, (l+r)/2);
        T vr = getvar(a, b, 2*k+2, (l+r)/2, r);
        return vl + vr;
    }

	T operator[](size_t idx) {
		return getvar(idx, idx + 1);
	}

	T operator[](pair<size_t, size_t> p) {
		return getvar(p.first, p.second);
	}

	void print(){
		cout << "{ " << getvar(0,1);
		for(int i = 1; i < M; ++i) cout << ", " << getvar(i,i+1);
		cout << " }" << endl;
	}
};

int main() {
    int N,Q; cin >> N >> Q;
    vector<ll> a(N+2,0);
    for(int i = 1; i <= N; ++i) cin >> a[i];
    Lazy_Segment_Tree_Range_Sum_Query<ll> seg1(a,0),seg2(N+2,0);
    for(int i = 0; i < N+1; ++i) seg2.update(i,i+1,a[i+1]!=a[i]);
    for(int i = 0; i < Q; ++i){
        int c; cin >> c;
        if(c==1){
            int l,r;
            ll x;
            cin >> l >> r >> x;
            seg1.update(l,r+1,x);
            ll vll = seg1.getvar(l-1,l);
            ll vlr = seg1.getvar(l,l+1);
            ll vrl = seg1.getvar(r,r+1);
            ll vrr = seg1.getvar(r+1,r+2);
            ll tl = seg2.getvar(l-1,l);
            ll tr = seg2.getvar(r,r+1);
            seg2.update(l-1,l,(vll!=vlr) - tl);
            seg2.update(r,r+1,(vrl!=vrr) - tr);
        }
        else {
            int l,r;
            cin >> l >> r;
            cout << seg2.getvar(l,r)+1 << endl;
        }
    }


    return 0;
}
0