結果
| 問題 | No.876 Range Compress Query |
| コンテスト | |
| ユーザー |
 outline
|
| 提出日時 | 2021-02-01 17:44:12 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 257 ms / 2,000 ms |
| コード長 | 6,656 bytes |
| 記録 | |
| コンパイル時間 | 1,509 ms |
| コンパイル使用メモリ | 140,528 KB |
| 最終ジャッジ日時 | 2025-01-18 10:37:21 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 18 |
ソースコード
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;
template<class T>
inline bool chmax(T& x, T y){
if(x < y){
x = y;
return true;
}
return false;
}
template<class T>
inline bool chmin(T& x, T y){
if(x > y){
x = y;
return true;
}
return false;
}
template<typename Monoid, typename OperatorMonoid = Monoid>
struct LazySegmentTree{
using F = function<Monoid(Monoid, Monoid)>;
using G = function<Monoid(Monoid, OperatorMonoid)>;
using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;
int sz;
vector<Monoid> data;
vector<OperatorMonoid> lazy;
const F f;
const G g;
const H h;
const Monoid M1; // モノイドの単位元
const OperatorMonoid OM0; // 作用素モノイドの単位元
LazySegmentTree(int n, const F f, const G g, const H h, const Monoid &M1, const OperatorMonoid OM0)
: f(f), g(g), h(h), M1(M1), OM0(OM0)
{
sz = 1;
while(sz < n) sz <<= 1;
data.assign(sz << 1, M1);
lazy.assign(sz << 1, OM0);
}
void set(int k, const Monoid &x){
data[k + sz] = x;
}
void build(){
for(int k = sz - 1; k > 0; --k){
data[k] = f(data[k << 1], data[k << 1 | 1]);
}
}
void propagate(int k){
if(lazy[k] != OM0){
if(k < sz){
lazy[k << 1] = h(lazy[k << 1], lazy[k]);
lazy[k << 1 | 1] = h(lazy[k << 1 | 1], lazy[k]);
}
data[k] = g(data[k], lazy[k]);
lazy[k] = OM0;
}
}
Monoid update(int a, int b, const OperatorMonoid &x, int k = 1, int l = 0, int r = -1){
if(r == -1) r = sz;
propagate(k);
if(r <= a || b <= l) return data[k];
else if(a <= l && r <= b){
lazy[k] = h(lazy[k], x);
propagate(k);
return data[k];
}
else{
return data[k] = f(update(a, b, x, k << 1, l, (l + r) >> 1),
update(a, b, x, k << 1 | 1, (l + r) >> 1, r));
}
}
Monoid query(int a, int b, int k = 1, int l = 0, int r = -1){
if(r == -1) r = sz;
propagate(k);
if(r <= a || b <= l) return M1;
else if(a <= l && r <= b) return data[k];
else{
return f(query(a, b, k << 1, l, (l + r) >> 1),
query(a, b, k << 1 | 1, (l + r) >> 1, r));
}
}
Monoid operator[](const int &k){
return query(k, k + 1);
}
};
template<typename Monoid>
struct SegmentTree{
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(const F f, const Monoid& M1) : f(f), M1(M1) {}
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while(sz < n) sz <<= 1;
seg.assign(2 * sz, M1);
}
void resize(int n){
sz = 1;
while(sz < n) sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x){
seg[k + sz] = x;
}
void build(){
for(int k = sz - 1; k > 0; --k){
seg[k] = f(seg[k << 1], seg[k << 1 | 1]);
}
}
void update(int k, const Monoid &x){
k += sz;
seg[k] = x;
while(k >>= 1){
seg[k] = f(seg[k << 1], seg[k << 1 | 1]);
}
}
Monoid query(int a, int b){
Monoid L = M1, R = M1;
for(a += sz, b += sz; a < b; a >>= 1, b >>= 1){
if(a & 1) L = f(L, seg[a++]);
if(b & 1) R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const{
return seg[k + sz];
}
// (type = true) : find_last
// (type = false) : find_first
template<typename C>
int find_subtree(int a, const C &check, Monoid &M, bool type){
while(a < sz){
Monoid nxt = type ? f(seg[a << 1 | type], M) : f(M, seg[a << 1 | type]);
if(check(nxt)) a = a << 1 | type;
else M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template<typename C>
int find_first(int a, const C &check){
Monoid L = M1;
if(a <= 0){
if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for(a += sz, b += sz; a < b; a >>= 1, b >>= 1){
if(a & 1){
Monoid nxt = f(L, seg[a]);
if(check(nxt)) return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template<typename C>
int find_last(int b, const C &check){
Monoid R = M1;
if(b >= sz){
if(check(f(seg[1], R))) return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for(b += sz; a < b; a >>= 1, b >>= 1){
if(b & 1){
Monoid nxt = f(seg[--b], R);
if(check(nxt)) return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, Q, a;
cin >> N >> Q;
auto op = [](ll a, ll b){return a + b;};
LazySegmentTree<ll, ll> seg(N, op, op, op, 0, 0);
for(int i = 0; i < N; ++i){
cin >> a;
seg.set(i, a);
}
seg.build();
SegmentTree<ll> G(N, op, 0);
for(int i = 0; i + 1 < N; ++i){
G.set(i, (seg[i] != seg[i + 1]));
}
G.build();
for(int i = 0; i < Q; ++i){
int q, l, r;
cin >> q >> l >> r;
--l;
if(q == 1){
int x;
cin >> x;
seg.update(l, r, x);
if(l > 0) G.update(l - 1, (seg[l - 1] != seg[l]));
if(r < N) G.update(r - 1, (seg[r - 1] != seg[r]));
}
else{
cout << G.query(l, r - 1) + 1 << '\n';
}
}
return 0;
}