結果
| 問題 | No.2697 Range LIS Query |
| ユーザー |
 Misuki
|
| 提出日時 | 2024-03-22 22:28:47 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 301 ms / 10,000 ms |
| コード長 | 6,118 bytes |
| コンパイル時間 | 2,292 ms |
| コンパイル使用メモリ | 206,544 KB |
| 実行使用メモリ | 35,328 KB |
| 最終ジャッジ日時 | 2024-09-30 11:58:32 |
| 合計ジャッジ時間 | 6,233 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 15 |
ソースコード
#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>
#if __cplusplus >= 202002L
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>
#else
#define ssize(v) (int)(v).size()
#define popcount(x) __builtin_popcountll(x)
constexpr int bit_width(const unsigned int x) { return x == 0 ? 0 : ((sizeof(unsigned int) * CHAR_BIT) - __builtin_clz(x)); }
constexpr int bit_width(const unsigned long long x) { return x == 0 ? 0 : ((sizeof(unsigned long long) * CHAR_BIT) - __builtin_clzll(x)); }
constexpr int countr_zero(const unsigned int x) { return x == 0 ? sizeof(unsigned int) * CHAR_BIT : __builtin_ctz(x); }
constexpr int countr_zero(const unsigned long long x) { return x == 0 ? sizeof(unsigned long long) * CHAR_BIT : __builtin_ctzll(x); }
constexpr unsigned int bit_ceil(const unsigned int x) { return x == 0 ? 1 : (popcount(x) == 1 ? x : (1u << bit_width(x))); }
constexpr unsigned long long bit_ceil(const unsigned long long x) { return x == 0 ? 1 : (popcount(x) == 1 ? x : (1ull << bit_width(x))); }
#endif
//#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)
#define clock chrono::steady_clock::now().time_since_epoch().count()
#ifdef DEBUG
#define dbg(x) cout << (#x) << " = " << x << '\n'
#else
#define dbg(x)
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
//#define double ldb
template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
for(const T &X : arr)
os << X << ' ';
return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
for(const T &X : vec)
os << X << ' ';
return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
for(const T &x : s)
os << x << ' ';
return os;
}
template<class M, M(*id)(), M(*op)(const M&, const M&)>
struct rangeSetSegmentTree {
vector<M> data, pre;
vector<int> tagId;
int size, nxt;
rangeSetSegmentTree(int _size) : data(2 * _size, id()), pre(_size), tagId(_size, -1), size(_size), nxt(0) {}
rangeSetSegmentTree(vector<M> init) : data(2 * ssize(init), id()), pre(ssize(init)), tagId(ssize(init), -1), size(ssize(init)), nxt(0) {
copy(init.begin(), init.end(), data.begin() + size);
for(int i = size - 1; i > 0; i--)
data[i] = op(data[i << 1], data[i << 1 | 1]);
}
void apply(int i, int tId) {
data[i] = pre[tId];
if (i < size) tagId[i] = tId;
}
void push(int i) {
for(int s = bit_width((unsigned)i) - 1; s > 0; s--) {
if (tagId[i >> s] != -1) {
apply(i >> (s - 1), tagId[i >> s] - 1);
apply(i >> (s - 1) ^ 1, tagId[i >> s] - 1);
tagId[i >> s] = -1;
}
}
}
void pull(int i) {
while(i >>= 1) data[i] = op(data[i << 1], data[i << 1 | 1]);
}
int trunc(unsigned i) { return i >> countr_zero(i); }
void set(int i, M x) {
push(i + size);
data[i + size] = x;
pull(i + size);
}
M get(int i) {
push(i + size);
return data[i + size];
}
void set(int l, int r, M x) {
if (l >= r or x == id()) return;
if (nxt + bit_width((unsigned)size) > size) {
for(int i = 1; i < size; i++) {
if (tagId[i] != -1) {
apply(i << 1, tagId[i] - 1);
apply(i << 1 | 1, tagId[i] - 1);
tagId[i] = -1;
}
}
nxt = 0;
}
for(int i = 0; i < bit_width((unsigned)size); i++, x = op(x, x))
pre[nxt++] = x;
push(trunc(l += size)), push(trunc(r += size) - 1);
int l0 = l, r0 = r;
for(int tId = nxt - bit_width((unsigned)size); l < r; l >>= 1, r >>= 1, tId++) {
if (l & 1) apply(l++, tId);
if (r & 1) apply(--r, tId);
}
pull(trunc(l0)), pull(trunc(r0) - 1);
}
M query(int l, int r) {
if (l >= r) return id();
M L = id(), R = id();
push(trunc(l += size)), push(trunc(r += size) - 1);
for(; l < r; l >>= 1, r >>= 1) {
if (l & 1) L = op(L, data[l++]);
if (r & 1) R = op(data[--r], R);
}
return op(L, R);
}
};
using M = array<array<int, 4>, 4>;
M id() { return M{}; }
M op(const M& L, const M& r) {
M res = {};
for(int i = 0; i < 4; i++)
for(int j = i; j < 4; j++)
for(int k = j; k < 4; k++)
for(int l = k; l < 4; l++)
res[i][l] = max(res[i][l], L[i][j] + r[k][l]);
return res;
}
M cons(int x) {
M res = {};
res[x][x] = 1;
return res;
}
int get(M x) {
int res = 0;
for(int i = 0; i < 4; i++)
for(int j = i; j < 4; j++)
res = max(res, x[i][j]);
return res;
}
signed main() {
ios::sync_with_stdio(false), cin.tie(NULL);
int n; cin >> n;
vector<int> a(n);
for(int &x : a) {
cin >> x;
x -= 1;
}
vector<M> init(n, id());
for(int i = 0; i < n; i++)
init[i] = cons(a[i]);
rangeSetSegmentTree<M, id, op> st(init);
int q; cin >> q;
while(q--) {
int op, l, r; cin >> op >> l >> r;
if (op == 1) {
cout << get(st.query(l - 1, r)) << '\n';
} else {
int x; cin >> x;
st.set(l - 1, r, cons(x - 1));
}
}
return 0;
}