結果
| 問題 | No.3507 RangeSum RangeUpdate RangeSqrt |
| コンテスト | |
| ユーザー |
 Magentor
|
| 提出日時 | 2026-04-18 01:28:16 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 427 ms / 2,000 ms |
| コード長 | 8,198 bytes |
| 記録 | |
| コンパイル時間 | 3,344 ms |
| コンパイル使用メモリ | 351,576 KB |
| 実行使用メモリ | 19,584 KB |
| 最終ジャッジ日時 | 2026-04-18 01:29:01 |
| 合計ジャッジ時間 | 16,892 ms |
|
ジャッジサーバーID （参考情報） |
judge3_0 / judge2_1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 29 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, m ,n) for (int i = (m); i < (long long)(n); i++)
#define REP(i, n) for (long long i = 1; i < (long long)(n); i++)
typedef long long ll;
#define updiv(N,X) (N + X - 1) / X
#define l(n) n.begin(),n.end()
#define YesNo(Q) Q==1?cout<<"Yes":cout<<"No"
using P = pair<int, int>;
const long long INF = 1e18;
unsigned int bit_ceil(unsigned int n) {
unsigned int x = 1;
while (x < (unsigned int)(n)) x *= 2;
return x;
}
// @param n `1 <= n`
// @return same with std::bit::countr_zero
int countr_zero(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
// @param n `1 <= n`
// @return same with std::bit::countr_zero
constexpr int countr_zero_constexpr(unsigned int n) {
int x = 0;
while (!(n & (1 << x))) x++;
return x;
}
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())) {
size = (int)bit_ceil((unsigned int)(_n));
log = countr_zero((unsigned int)size);
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]);
if (d[k].fail) push(k), update(k); // <-- add
}
}
void push(int k) {
all_apply(2 * k, lz[k]);
all_apply(2 * k + 1, lz[k]);
lz[k] = id();
}
};
namespace segt{
ll isqrt(ll n) {
return floor(sqrt((double long)(n))+0.0000000001);
}
struct S{
ll mx;
ll mn;
ll sz;
ll sm;
bool fail;
S() : mx(0), mn(INF), sz(0), sm(0), fail(false) {}
S(ll x, ll sz_ = 1) : mx(x), mn(x), sz(sz_), sm(x * sz_), fail(false) {}
};
S e(){
return S();
}
S op(S a,S b){
if (b.sz == 0) return a;
if (a.sz == 0) return b;
S ret;
ret.mx = max(a.mx,b.mx);
ret.mn = min(a.mn,b.mn);
ret.sz = a.sz+b.sz;
ret.sm = a.sm+b.sm;
ret.fail = false;
return ret;
}
struct F{
ll val;
int num;
bool flag;
F() : val(0),num(0),flag(false) {}
};
F id(){
return F();
}
F composition(F nw,F old){
if(nw.flag){return nw;}
if(old.flag){
rep(i,nw.num){
if(1==old.val){break;}
old.val = isqrt(old.val);
}
old.flag = true;
old.num = 0;
return old;
}
F res;
res.val = 0;
res.num = old.num + nw.num;
res.flag = false;
return res;
}
S mapping(F f, S x) {
if(x.fail) return x;
if(f.flag) {
x.mx = f.val;
x.mn = f.val;
x.sm = f.val * x.sz;
}
if(f.num > 0) {
if(x.mx == x.mn) {
ll v = x.mx;
rep(i, f.num) {
if(v <= 1){break;}
v = isqrt(v);
}
x.mx = v;
x.mn = v;
x.sm = v * x.sz;
} else {
x.fail = true;
}
}
return x;
}
using segtree = lazy_segtree<S, op, e, F, mapping, composition, id>;
}
using namespace segt;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,q;cin>>n>>q;
vector<S> a(n);
rep(i,n){
ll x;cin>>x;
a[i] = S(x,1);
}
segtree seg(a);
while(q--){
int t;cin>>t;
if(t==0){
int l,r;cin>>l>>r;
cout << seg.prod(l,r).sm << endl;
}
else if(t==1){
int l, r;
ll x;
cin>>l>>r>>x;
F f;
f.flag = true;
f.val = x;
seg.apply(l, r, f);
}
else if(t==2) {
int l, r;
cin>>l>>r;
F f;
f.num = 1;
seg.apply(l,r,f);
}
}
}