Test/yukicoder/yuki2697.test.cpp

• View this file on GitHub
• Last update: 2024-03-23 18:33:32+09:00
• Problem: https://yukicoder.me/problems/no/2697

Depends on

• 遅延評価セグメント木 (DataStructure/segtree_lazy.hpp)

Code

#define PROBLEM "https://yukicoder.me/problems/no/2697"

#include <bits/stdc++.h>

#include "DataStructure/segtree_lazy.hpp"

using namespace std;
using ll = long long;

using S = array<array<int,4>,4>;
using F = int;

S op(S lS, S rS){
	S tmp{};
	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++){
					tmp[i][l] = max(tmp[i][l], lS[i][j] + rS[k][l]);
				}
			}
		}
	}
	return tmp;
}

S e(){
	S tmp{};
	return tmp;
}

// x に f を作用させた時の変化

S mapping(F f, S x){
	if(f == -1) return x;
	int c = 0;
	for(int i = 0; i < 4; i++){
		c += x[i][i];
		for(int j = i; j < 4; j++){
			x[i][j] = 0;
		}
	}
	x[f][f] = c;
	return x;
}

F composition(F af, F bf){
	if(af == -1) return bf;
	return af;
}

F id(){return -1;}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	vector<S> a(n);
	S tmp{};
	for(int i = 0; i < n; i++){
		int v;
		cin >> v;
		v--;
		tmp[v][v]++;
		a[i] = tmp;
		tmp[v][v]--;
	}
	lazy_segtree<S, op, e, F, mapping, composition, id> seg(a);
	int Q;
	cin >> Q;
	while(Q--){
		int cmd, l, r;
		cin >> cmd >> l >> r;
		l--;
		if(cmd == 1){
			auto v = seg.prod(l, r);
			int ans = 0, sv = 0;
			for(int i = 0; i < 4; i++){
				for(int j = i; j < 4; j++){
					ans = max(ans, v[i][j]);
				}
			}
			cout << ans << '\n';
		}else{
			int v;
			cin >> v;
			v--;
			seg.apply(l, r, v);
		}
	}
}

#line 1 "Test/yukicoder/yuki2697.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/2697"

#include <bits/stdc++.h>

#line 1 "DataStructure/segtree_lazy.hpp"
template <class S,
            S (*op)(S, S),
            S (*e)(),
            class F,
            S (*mapping)(F, S),
            F (*composition)(F, F),
            F (*id)()>
struct lazy_segtree {
    public:
    lazy_segtree() : lazy_segtree(0) {}
    lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
    lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        lz = std::vector<F>(size, id());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }
    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    S get(int p) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        return d[p];
    }
    const S operator[](int p) const { return get(p); }
    S operator[](int p) { return get(p); }
    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return e();
        l += size;
        r += size;
        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push(r >> i);
        }
        S sml = e(), smr = e();
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }
    S all_prod() { return d[1]; }
    void apply(int p, F f) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = mapping(f, d[p]);
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    void apply(int l, int r, F f) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return;
        l += size;
        r += size;
        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }
        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }
        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }
    template <bool (*g)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return g(x); });
    }
    template <class G> int max_right(int l, G g) {
        assert(0 <= l && l <= _n);
        assert(g(e()));
        if (l == _n) return _n;
        l += size;
        for (int i = log; i >= 1; i--) push(l >> i);
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!g(op(sm, d[l]))) {
                while (l < size) {
                    push(l);
                    l = (2 * l);
                    if (g(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }
    template <bool (*g)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return g(x); });
    }
    template <class G> int min_left(int r, G g) {
        assert(0 <= r && r <= _n);
        assert(g(e()));
        if (r == 0) return 0;
        r += size;
        for (int i = log; i >= 1; i--) push((r - 1) >> i);
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!g(op(d[r], sm))) {
                while (r < size) {
                    push(r);
                    r = (2 * r + 1);
                    if (g(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
    private:
    int _n, size, log;
    std::vector<S> d;
    std::vector<F> lz;
    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
    void all_apply(int k, F f) {
        d[k] = mapping(f, d[k]);
        if (k < size) lz[k] = composition(f, lz[k]);
    }
    void push(int k) {
        all_apply(2 * k, lz[k]);
        all_apply(2 * k + 1, lz[k]);
        lz[k] = id();
    }
    int ceil_pow2(int n) {
        int x = 0;
        while ((1U << x) < (unsigned int)(n)) x++;
        return x;
    }
};
#line 5 "Test/yukicoder/yuki2697.test.cpp"
using namespace std;
using ll = long long;

using S = array<array<int,4>,4>;
using F = int;

S op(S lS, S rS){
	S tmp{};
	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++){
					tmp[i][l] = max(tmp[i][l], lS[i][j] + rS[k][l]);
				}
			}
		}
	}
	return tmp;
}

S e(){
	S tmp{};
	return tmp;
}

// x に f を作用させた時の変化

S mapping(F f, S x){
	if(f == -1) return x;
	int c = 0;
	for(int i = 0; i < 4; i++){
		c += x[i][i];
		for(int j = i; j < 4; j++){
			x[i][j] = 0;
		}
	}
	x[f][f] = c;
	return x;
}

F composition(F af, F bf){
	if(af == -1) return bf;
	return af;
}

F id(){return -1;}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	vector<S> a(n);
	S tmp{};
	for(int i = 0; i < n; i++){
		int v;
		cin >> v;
		v--;
		tmp[v][v]++;
		a[i] = tmp;
		tmp[v][v]--;
	}
	lazy_segtree<S, op, e, F, mapping, composition, id> seg(a);
	int Q;
	cin >> Q;
	while(Q--){
		int cmd, l, r;
		cin >> cmd >> l >> r;
		l--;
		if(cmd == 1){
			auto v = seg.prod(l, r);
			int ans = 0, sv = 0;
			for(int i = 0; i < 4; i++){
				for(int j = i; j < 4; j++){
					ans = max(ans, v[i][j]);
				}
			}
			cout << ans << '\n';
		}else{
			int v;
			cin >> v;
			v--;
			seg.apply(l, r, v);
		}
	}
}

Back to top page