結果
| 問題 |
No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
|
| コンテスト | |
| ユーザー |
 Gandalfr
|
| 提出日時 | 2024-02-11 01:09:46 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 142 ms / 5,000 ms |
| コード長 | 10,631 bytes |
| コンパイル時間 | 2,200 ms |
| コンパイル使用メモリ | 202,620 KB |
| 最終ジャッジ日時 | 2025-02-19 04:49:27 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 17 |
ソースコード
#line 1 "src/main.cpp"
#include <bits/stdc++.h>
#line 8 "library/gandalfr/other/io.hpp"
///////////////////// output /////////////////////
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++)
os << v[i] << (i + 1 != (int)v.size() ? " " : "");
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::set<T> &st) {
for (const T &x : st) {
std::cout << x << " ";
}
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::multiset<T> &st) {
for (const T &x : st) {
std::cout << x << " ";
}
return os;
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {
os << p.first << ' ' << p.second;
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, std::queue<T> q) {
while (!q.empty()) {
os << q.front();
q.pop();
}
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::deque<T> &dq) {
for (const T &x : dq) {
std::cout << x << " ";
}
return os;
}
template <typename Tp, typename Sequence, typename Compare>
std::ostream &operator<<(std::ostream &os,
std::priority_queue<Tp, Sequence, Compare> q) {
while (!q.empty()) {
os << q.top();
q.pop();
}
return os;
}
///////////////////// input /////////////////////
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2>
std::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
#line 2 "library/gandalfr/data_structure/LazySegtree.hpp"
#line 5 "library/gandalfr/data_structure/LazySegtree.hpp"
#line 1 "library/atcoder/lazysegtree.hpp"
#line 8 "library/atcoder/lazysegtree.hpp"
#line 1 "library/atcoder/internal_bit.hpp"
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n))
x++;
return x;
}
// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
constexpr int bsf_constexpr(unsigned int n) {
int x = 0;
while (!(n & (1 << x)))
x++;
return x;
}
// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
} // namespace internal
} // namespace atcoder
#line 10 "library/atcoder/lazysegtree.hpp"
namespace atcoder {
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) {}
explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
explicit lazy_segtree(const std::vector<S> &v) : _n(int(v.size())) {
log = internal::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 - 1) >> 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();
}
};
} // namespace atcoder
#line 2 "library/gandalfr/types.hpp"
#line 5 "library/gandalfr/types.hpp"
namespace gandalfr {
using i8 = signed char;
using i16 = signed short int;
using i32 = signed int;
using i64 = signed long long int;
using i128 = __int128_t;
using u8 = unsigned char;
using u16 = unsigned short int;
using u32 = unsigned int;
using u64 = unsigned long long int;
using u128 = __uint128_t;
constexpr i8 IMAX8 = INT8_MAX;
constexpr i16 IMAX16 = INT16_MAX;
constexpr i32 IMAX32 = INT32_MAX;
constexpr i64 IMAX64 = INT64_MAX;
constexpr i8 IMIN8 = INT8_MIN;
constexpr i16 IMIN16 = INT16_MIN;
constexpr i32 IMIN32 = INT32_MIN;
constexpr i64 IMIN64 = INT64_MIN;
constexpr u8 UMAX8 = UINT8_MAX;
constexpr u16 UMAX16 = UINT16_MAX;
constexpr u32 UMAX32 = UINT32_MAX;
constexpr u64 UMAX64 = UINT64_MAX;
constexpr i64 MOD998 = 998244353;
constexpr i64 MOD107 = 1000000007;
constexpr double PI = M_PI;
} // namespace gandalfr
#line 8 "library/gandalfr/data_structure/LazySegtree.hpp"
namespace gandalfr {
template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),
F (*composition)(F, F), F (*id)()>
struct LazySegtree
: public atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> {
using atcoder::lazy_segtree<S, op, e, F, mapping, composition,
id>::lazy_segtree;
const S operator[](int x) { return this->get(x); }
void print(i32 l, i32 r) {
for (i32 i = l; i < r; ++i) {
std::cout << this->get(i) << (i == r - 1 ? " " : "");
}
std::cout << std::endl;
}
};
} // namespace gandalfr
#line 4 "src/main.cpp"
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INFLL = 1001001001001001001;
#define rep(i, j, n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define rrep(i, j, n) for(ll i = (ll)(n-1); i >= (ll)(j); i--)
#define all(a) (a).begin(),(a).end()
#define LF cout << endl
#define debug(a) std::cerr << #a << ": " << a << std::endl
template<typename Key, typename Value> inline bool map_chmax(std::map<Key, Value>& mp, const Key& a, const Value& b) {
auto it = mp.find(a);
return it == mp.end() ? (mp[a] = b, true) : chmax(it->second, b);
}
template<typename Key, typename Value> inline bool map_chmin(std::map<Key, Value>& mp, const Key& a, const Value& b) {
auto it = mp.find(a);
return it == mp.end() ? (mp[a] = b, true) : chmin(it->second, b);
}
void Yes(bool ok){ std::cout << (ok ? "Yes" : "No") << std::endl; }
using namespace gandalfr;
struct S {
int a, b, size;
};
struct F {
int a, b;
};
S op(S x, S y) {
return {x.a + y.a, x.b + y.b, x.size + y.size};
}
S e() {
return {0, 0, 0};
}
F id() {
return {0, 0};
}
S mapping(F f, S x) {
return (f.a == 0 && f.b == 0 ? x : S{x.size * f.a, x.size * f.b, x.size});
}
F composition(F f, F g) {
return (f.a == 0 && f.b == 0 ? g : f);
}
int main(void){
int N, Q;
cin >> N >> Q;
vector<S> A(N, {0, 0, 1});
ll a = 0, b = 0;
LazySegtree<S, op, e, F, mapping, composition, id> seg(A);
rep(i,0,Q) {
int q, l, r;
cin >> q >> l >> r;
r++;
if (q == 0) {
auto [a_pt, b_pt, _sz] = seg.prod(l, r);
if (a_pt > b_pt) {
a += a_pt;
} else if (a_pt < b_pt) {
b += b_pt;
}
} else if (q == 1) {
seg.apply(l, r, {1, 0});
} else {
seg.apply(l, r, {0, 1});
}
}
auto [a_pt, b_pt, _sz] = seg.all_prod();
a += a_pt, b += b_pt;
cout << a << " " << b << endl;
}