結果

問題 No.255 Splarrraaay スプラーレェーーイ
ユーザー t98slidert98slider
提出日時 2023-01-30 22:34:01
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,043 ms / 10,000 ms
コード長 7,807 bytes
コンパイル時間 2,089 ms
コンパイル使用メモリ 191,160 KB
実行使用メモリ 162,532 KB
最終ジャッジ日時 2024-06-30 06:41:57
合計ジャッジ時間 12,914 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1'000'000'000'000'000'009ll;
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];
}
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;
}
};
using S = pair<ll, ll>;
using F = pair<ll, ll>;
//
S e(){return S({0, 0});}
//
S op(S l, S r){
return make_pair(l.first + r.first, l.second + r.second);
}
//xf
S mapping(F f, S x){
return make_pair(x.first * f.first + x.second * f.second, x.second);
}
//gf
F composition(F f, F g){
return make_pair(f.first * g.first, g.second * f.first + f.second);
}
//
F id(){return make_pair(1, 0);}
//a[0], a[1]
//a[0] * x[0] + a[1] * x[1], a[1]
//x[0] * y[0], x[1] * y[0] + y[1]
void add(ll &x, ll y){
x += y;
while(x >= MOD)x -= MOD;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll N, l, r;
int Q, cmd;
cin >> N >> Q;
vector<tuple<int, ll, ll>> query(Q);
vector<ll> ca = {0, N};
for(int i = 0; i < Q; i++){
cin >> cmd >> l >> r;
r++;
query[i] = make_tuple(cmd, l, r);
ca.push_back(l);
ca.push_back(r);
}
sort(ca.begin(), ca.end());
ca.erase(unique(ca.begin(), ca.end()), ca.end());
vector<S> temp(ca.size(), make_pair(0, 0));
for(int i = 0; i + 1 < ca.size(); i++){
temp[i].second = ca[i + 1] - ca[i];
}
vector<lazy_segtree<S, op, e, F, mapping, composition, id>> seg(5,
lazy_segtree<S, op, e, F, mapping, composition, id>(temp));
array<ll, 5> score{}, temp2{};
for(int i = 0; i < Q; i++){
tie(cmd, l, r) = query[i];
l = lower_bound(ca.begin(), ca.end(), l) - ca.begin();
r = lower_bound(ca.begin(), ca.end(), r) - ca.begin();
if(cmd == 0){
for(int i = 0; i < 5; i++){
temp2[i] = seg[i].prod(l, r).first;
}
auto it = max_element(temp2.begin(), temp2.end());
if(count(temp2.begin(), temp2.end(), *it) >= 2)continue;
add(score[it - temp2.begin()], *it);
}else{
cmd--;
for(int i = 0; i < 5; i++){
if(i == cmd)seg[i].apply(l, r, {1, 1});
else seg[i].apply(l, r, {0, 0});
}
}
}
for(int i = 0; i < 5; i++){
add(score[i], seg[i].all_prod().first);
cout << score[i] << (i + 1 == 5 ? '\n' : ' ');
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0