結果

問題 No.2697 Range LIS Query
ユーザー ei1333333ei1333333
提出日時 2024-03-22 23:01:25
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 583 ms / 10,000 ms
コード長 10,148 bytes
コンパイル時間 4,582 ms
コンパイル使用メモリ 275,152 KB
実行使用メモリ 28,764 KB
最終ジャッジ日時 2024-09-30 12:22:44
合計ジャッジ時間 11,462 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
os << p.first << " " << p.second;
return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
is >> p.first >> p.second;
return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
for(int i = 0; i < (int) v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
for(T &in : v) is >> in;
return is;
}
template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template< typename T = int64 >
vector< T > make_v(size_t a) {
return vector< T >(a);
}
template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}
template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
t = v;
}
template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
for(auto &e : t) fill_v(e, v);
}
template< typename F >
struct FixPoint : F {
explicit FixPoint(F &&f) : F(forward< F >(f)) {}
template< typename... Args >
decltype(auto) operator()(Args &&... args) const {
return F::operator()(*this, forward< Args >(args)...);
}
};
template< typename F >
inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
#line 1 "math/matrix/square-matrix.hpp"
/**
* @brief Square-Matrix()
*/
template< class T, size_t N >
struct SquareMatrix {
array< array< T, N >, N > A;
SquareMatrix() : A{{}} {}
size_t size() const { return N; }
inline const array< T, N > &operator[](int k) const {
return (A.at(k));
}
inline array< T, N > &operator[](int k) {
return (A.at(k));
}
static SquareMatrix add_identity() {
return SquareMatrix();
}
static SquareMatrix mul_identity() {
SquareMatrix mat;
for(size_t i = 0; i < N; i++) mat[i][i] = 1;
return mat;
}
SquareMatrix &operator+=(const SquareMatrix &B) {
for(size_t i = 0; i < N; i++) {
for(size_t j = 0; j < N; j++) {
(*this)[i][j] += B[i][j];
}
}
return *this;
}
SquareMatrix &operator-=(const SquareMatrix &B) {
for(size_t i = 0; i < N; i++) {
for(size_t j = 0; j < N; j++) {
(*this)[i][j] -= B[i][j];
}
}
return *this;
}
SquareMatrix &operator*=(const SquareMatrix &B) {
array< array< T, N >, N > C;
for(size_t i = 0; i < N; i++) {
for(size_t j = 0; j < N; j++) {
for(size_t k = 0; k < N; k++) {
C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);
}
}
}
A.swap(C);
return (*this);
}
SquareMatrix &operator^=(uint64_t k) {
SquareMatrix B = SquareMatrix::mul_identity();
while(k > 0) {
if(k & 1) B *= *this;
*this *= *this;
k >>= 1LL;
}
A.swap(B.A);
return *this;
}
SquareMatrix operator+(const SquareMatrix &B) const {
return SquareMatrix(*this) += B;
}
SquareMatrix operator-(const SquareMatrix &B) const {
return SquareMatrix(*this) -= B;
}
SquareMatrix operator*(const SquareMatrix &B) const {
return SquareMatrix(*this) *= B;
}
SquareMatrix operator^(uint64_t k) const {
return SquareMatrix(*this) ^= k;
}
friend ostream &operator<<(ostream &os, SquareMatrix &p) {
for(int i = 0; i < N; i++) {
os << "[";
for(int j = 0; j < N; j++) {
os << p[i][j] << (j + 1 == N ? "]\n" : ",");
}
}
return os;
}
};
#line 1 "structure/segment-tree/lazy-segment-tree.hpp"
/**
* @brief Lazy-Segment-Tree()
* @docs docs/lazy-segment-tree.md
*/
template< typename T, typename E, typename F, typename G, typename H >
struct LazySegmentTree {
private:
int n{}, sz{}, height{};
vector< T > data;
vector< E > lazy;
const F f;
const G g;
const H h;
const T ti;
const E ei;
inline void update(int k) {
data[k] = f(data[2 * k + 0], data[2 * k + 1]);
}
inline void all_apply(int k, const E &x) {
data[k] = g(data[k], x);
if(k < sz) lazy[k] = h(lazy[k], x);
}
inline void propagate(int k) {
if(lazy[k] != ei) {
all_apply(2 * k + 0, lazy[k]);
all_apply(2 * k + 1, lazy[k]);
lazy[k] = ei;
}
}
public:
LazySegmentTree() = default;
explicit LazySegmentTree(int n, const F f, const G g, const H h,
const T &ti, const E &ei)
: n(n), f(f), g(g), h(h), ti(ti), ei(ei) {
sz = 1;
height = 0;
while(sz < n) sz <<= 1, height++;
data.assign(2 * sz, ti);
lazy.assign(2 * sz, ei);
}
explicit LazySegmentTree(const vector< T > &v, const F f, const G g, const H h,
const T &ti, const E &ei)
: LazySegmentTree(v.size(), f, g, h, ti, ei) {
build(v);
}
void build(const vector< T > &v) {
assert(n == (int) v.size());
for(int k = 0; k < n; k++) data[k + sz] = v[k];
for(int k = sz - 1; k > 0; k--) update(k);
}
void set(int k, const T &x) {
k += sz;
for(int i = height; i > 0; i--) propagate(k >> i);
data[k] = x;
for(int i = 1; i <= height; i++) update(k >> i);
}
T get(int k) {
k += sz;
for(int i = height; i > 0; i--) propagate(k >> i);
return data[k];
}
T operator[](int k) {
return get(k);
}
T prod(int l, int r) {
if(l >= r) return ti;
l += sz;
r += sz;
for(int i = height; i > 0; i--) {
if(((l >> i) << i) != l) propagate(l >> i);
if(((r >> i) << i) != r) propagate((r - 1) >> i);
}
T L = ti, R = ti;
for(; l < r; l >>= 1, r >>= 1) {
if(l & 1) L = f(L, data[l++]);
if(r & 1) R = f(data[--r], R);
}
return f(L, R);
}
T all_prod() const {
return data[1];
}
void apply(int k, const E &x) {
k += sz;
for(int i = height; i > 0; i--) propagate(k >> i);
data[k] = g(data[k], x);
for(int i = 1; i <= height; i++) update(k >> i);
}
void apply(int l, int r, const E &x) {
if(l >= r) return;
l += sz;
r += sz;
for(int i = height; i > 0; i--) {
if(((l >> i) << i) != l) propagate(l >> i);
if(((r >> i) << i) != r) propagate((r - 1) >> i);
}
{
int l2 = l, r2 = r;
for(; l < r; l >>= 1, r >>= 1) {
if(l & 1) all_apply(l++, x);
if(r & 1) all_apply(--r, x);
}
l = l2, r = r2;
}
for(int i = 1; i <= height; i++) {
if(((l >> i) << i) != l) update(l >> i);
if(((r >> i) << i) != r) update((r - 1) >> i);
}
}
template< typename C >
int find_first(int l, const C &check) {
if(l >= n) return n;
l += sz;
for(int i = height; i > 0; i--) propagate(l >> i);
T sum = ti;
do {
while((l & 1) == 0) l >>= 1;
if(check(f(sum, data[l]))) {
while(l < sz) {
propagate(l);
l <<= 1;
auto nxt = f(sum, data[l]);
if(not check(nxt)) {
sum = nxt;
l++;
}
}
return l + 1 - sz;
}
sum = f(sum, data[l++]);
} while((l & -l) != l);
return n;
}
template< typename C >
int find_last(int r, const C &check) {
if(r <= 0) return -1;
r += sz;
for(int i = height; i > 0; i--) propagate((r - 1) >> i);
T sum = ti;
do {
r--;
while(r > 1 and (r & 1)) r >>= 1;
if(check(f(data[r], sum))) {
while(r < sz) {
propagate(r);
r = (r << 1) + 1;
auto nxt = f(data[r], sum);
if(not check(nxt)) {
sum = nxt;
r--;
}
}
return r - sz;
}
sum = f(data[r], sum);
} while((r & -r) != r);
return -1;
}
};
template< typename T, typename E, typename F, typename G, typename H >
LazySegmentTree< T, E, F, G, H > get_lazy_segment_tree
(int N, const F &f, const G &g, const H &h, const T &ti, const E &ei) {
return LazySegmentTree{N, f, g, h, ti, ei};
}
template< typename T, typename E, typename F, typename G, typename H >
LazySegmentTree< T, E, F, G, H > get_lazy_segment_tree
(const vector< T > &v, const F &f, const G &g, const H &h, const T &ti, const E &ei) {
return LazySegmentTree{v, f, g, h, ti, ei};
}
int main() {
int N;
cin >> N;
vector<int> A(N);
cin >> A;
int Q;
cin >> Q;
using S = SquareMatrix<int, 4>;
using pi = pair< S, int >;
S e;
auto f = [&](const pi &a, const pi &b) {
S c = e;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++) {
chmax(c[i][k], a.first[i][j] + b.first[j][k]);
}
}
}
return pi(c, a.second + b.second);
};
auto g = [&](const pi& a, int x) {
S c = e;
for(int i = 0; i <= x; i++) {
chmax(c[i][x], a.second);
}
return pi(c, a.second);
};
auto h = [](int a, int b) {
return b;
};
for(int i = 0; i < 4; i++) {
for(int j = 0; j < 4; j++) {
e[i][j] = -inf;
}
for(int j = 0; j <= i; j++) {
e[i][i] = 0;
}
}
vector< pi > vs(N, pi(e, 1));
for(int i = 0; i < N; i++) {
--A[i];
for(int j = 0; j <= A[i]; j++) {
chmax(vs[i].first[j][A[i]], 1);
}
}
auto seg = get_lazy_segment_tree(vs, f, g, h, pi(e, 0), -1);
while(Q--) {
int t, l, r, x;
cin >> t >> l >> r;
--l;
if(t == 1) {
auto res = seg.prod(l, r).first[0];
cout << *max_element(res.begin(), res.end()) << "\n";
} else {
cin >> x;
--x;
seg.apply(l, r, x);
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0