#1158325 (C++23) No.3507 RangeSum RangeUpdate RangeSqrt

提出ソース
結果

問題	No.3507 RangeSum RangeUpdate RangeSqrt
コンテスト
ユーザー	noya2
提出日時	2026-04-17 22:55:31
言語	C++23 (gcc 15.2.0 + boost 1.89.0) コンパイル: `g++-15 -O2 -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_` 実行: `./a.out`
結果	AC
実行時間	333 ms / 2,000 ms
コード長	9,266 bytes
記録記録タグの例: 初AC ショートコード純ショートコード純主流ショートコード最速実行時間
コンパイル時間	8,847 ms
コンパイル使用メモリ	347,532 KB
実行使用メモリ	6,400 KB
最終ジャッジ日時	2026-04-17 22:55:49
合計ジャッジ時間	10,574 ms
ジャッジサーバーID （参考情報）	judge1_0 / judge2_0
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 1
other	AC * 29
権限があれば一括ダウンロードができます
ソースコード

raw source code
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

const int lg = 5;
array<int,lg> make(int n){
    array<int,lg> ret = {};
    ret[0] = n;
    repp(i,1,lg){
        ret[i] = sqrt_fast(ret[i-1]);
    }
    return ret;
}

void solve(){
    int n, q; in(n,q);
    vector<int> a(n); in(a);
    vector<array<int,lg>> b(n);
    rep(i,n){
        b[i] = make(a[i]);
    }
    const int mx = 300;
    // const int mx = 2;
    const int sz = n / mx + 1;
    vector<array<ll,lg>> rui(sz);
    vector<array<int,lg>> tos(sz,{-1});
    vector<int> cnts(sz), ones(sz);
    rep(i,n){
        rep(j,lg){
            rui[i/mx][j] += b[i][j];
        }
        ones[i/mx] += int(b[i][0] >= 1);
    }
    auto build = [&](int id){
        rui[id] = {};
        ones[id] = 0;
        repp(i,id*mx,id*mx+mx){
            rep(j,lg){
                rui[id][j] += b[i][j];
            }
            if (b[i][0] >= 1){
                ones[id]++;
            }
        }
    };
    auto push = [&](int id){
        int k = cnts[id];
        if (k >= lg){
            array<int,lg> tmp0 = {0,0,0,0,0};
            array<int,lg> tmp1 = {1,1,1,1,1};
            if (tos[id][0] == -1){
                repp(i,id*mx,id*mx+mx){
                    b[i] = (b[i][0] >= 1 ? tmp1 : tmp0);
                }
            }
            else {
                auto tmp = (tos[id][0] >= 1 ? tmp1 : tmp0);
                repp(i,id*mx,id*mx+mx){
                    b[i] = tmp;
                }
            }
            tos[id][0] = -1;
            cnts[id] = 0;
            return ;
        }
        if (tos[id][0] == -1){
            if (k == 0) return ;
            repp(i,id*mx,id*mx+mx){
                b[i] = make(b[i][k]);
            }
            cnts[id] = 0;
            return ;
        }
        auto tmp = make(tos[id][k]);
        repp(i,id*mx,id*mx+mx){
            b[i] = tmp;
        }
        tos[id][0] = -1;
        cnts[id] = 0;
    };
    auto prod_naive = [&](int l, int r) -> ll {
        // out("naive",l,r);
        // [l, r) in same block
        int id = l / mx;
        int k = cnts[id];
        if (k >= lg){
            int ret = 0;
            if (tos[id][0] == -1){
                repp(i,l,r){
                    ret += int(b[i][0] >= 1);
                }
            }
            else {
                ret = (tos[id][0] >= 1 ? r-l : 0);
            }
            return ret;
        }
        if (tos[id][0] != -1){
            return tos[id][k] * ll(r - l);
        }
        ll ret = 0;
        repp(i,l,r){
            ret += b[i][k];
        }
        return ret;
    };
    auto prod_id = [&](int id) -> ll {
        // out("id",id);
        int k = cnts[id];
        if (k >= lg){
            if (tos[id][0] == -1){
                return ones[id];
            }
            return (tos[id][0] >= 1 ? mx : 0);
        }
        if (tos[id][0] != -1){
            return tos[id][k] * ll(mx);
        }
        return rui[id][k];
    };
    auto prod = [&](int l, int r){
        int lid = ceil_div(l,mx);
        int rid = floor_div(r,mx);
        if (lid > rid){
            return prod_naive(l,r);
        }
        ll ret = prod_naive(l,lid*mx) + prod_naive(rid*mx,r);
        repp(id,lid,rid){
            ret += prod_id(id);
        }
        return ret;
    };
    auto assign_naive = [&](int l, int r, int x){
        int id = l / mx;
        push(id);
        auto tmp = make(x);
        repp(i,l,r){
            b[i] = tmp;
        }
        build(id);
    };
    auto assign_id = [&](int id, array<int,lg> makex){
        tos[id] = makex;
        cnts[id] = 0;
    };
    auto assign = [&](int l, int r, int x){
        int lid = ceil_div(l,mx);
        int rid = floor_div(r,mx);
        if (lid > rid){
            assign_naive(l,r,x);
            return ;
        }
        assign_naive(l,lid*mx,x);
        assign_naive(rid*mx,r,x);
        auto makex = make(x);
        repp(id,lid,rid){
            assign_id(id,makex);
        }
    };
    auto apply_naive = [&](int l, int r){
        int id = l / mx;
        push(id);
        repp(i,l,r){
            rep(j,lg-1){
                b[i][j] = b[i][j+1];
            }
            b[i][lg-1] = sqrt_fast(b[i][lg-2]);
        }
        build(id);
    };
    auto apply_id = [&](int id){
        cnts[id]++;
    };
    auto apply = [&](int l, int r){
        int lid = ceil_div(l,mx);
        int rid = floor_div(r,mx);
        if (lid > rid){
            apply_naive(l,r);
            return ;
        }
        apply_naive(l,lid*mx);
        apply_naive(rid*mx,r);
        repp(id,lid,rid){
            apply_id(id);
        }
    };
    while (q--){
        int t; in(t);
        if (t == 0){
            int l, r; in(l,r);
            out(prod(l,r));
        }
        else if (t == 1){
            int l, r, x; in(l,r,x);
            assign(l,r,x);
        }
        else if (t == 2){
            int l, r; in(l,r);
            apply(l,r);
        }
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
yukicoder

結果

ソースコード
