結果

問題 No.1441 MErGe
ユーザー yuto1115yuto1115
提出日時 2021-03-26 21:46:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 455 ms / 1,000 ms
コード長 4,557 bytes
コンパイル時間 2,063 ms
コンパイル使用メモリ 204,304 KB
実行使用メモリ 7,068 KB
最終ジャッジ日時 2023-08-19 07:54:57
合計ジャッジ時間 11,836 ms
ジャッジサーバーID
(参考情報)
judge10 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 3 ms
4,380 KB
testcase_04 AC 3 ms
4,380 KB
testcase_05 AC 11 ms
4,380 KB
testcase_06 AC 12 ms
4,380 KB
testcase_07 AC 13 ms
4,376 KB
testcase_08 AC 122 ms
4,376 KB
testcase_09 AC 123 ms
4,380 KB
testcase_10 AC 207 ms
4,376 KB
testcase_11 AC 199 ms
4,380 KB
testcase_12 AC 206 ms
4,376 KB
testcase_13 AC 309 ms
6,684 KB
testcase_14 AC 316 ms
6,708 KB
testcase_15 AC 334 ms
6,476 KB
testcase_16 AC 305 ms
6,724 KB
testcase_17 AC 295 ms
6,708 KB
testcase_18 AC 363 ms
6,004 KB
testcase_19 AC 404 ms
6,152 KB
testcase_20 AC 324 ms
5,888 KB
testcase_21 AC 297 ms
5,524 KB
testcase_22 AC 455 ms
5,160 KB
testcase_23 AC 421 ms
6,928 KB
testcase_24 AC 421 ms
7,056 KB
testcase_25 AC 415 ms
6,932 KB
testcase_26 AC 416 ms
6,936 KB
testcase_27 AC 420 ms
7,068 KB
testcase_28 AC 186 ms
6,932 KB
testcase_29 AC 187 ms
7,068 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(i,n) for (ll i = ll(n)-1; i >= 0; i--)
#define rrep2(i,n,t) for (ll i = ll(n)-1; i >= (ll)t; i--)
#define rrep3(i,n,t,d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)
#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define popcount(x) __builtin_popcount(x)
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using LP = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vp = vector<P>;
using vvp = vector<vector<P>>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
template<class T> void vecout(const vector<T> &v,char div='\n') { rep(i,v.size()) cout<<v[i]<<(i==int(v.size()-1)?'\n':div);}
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
void scan(){}
template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }
template<class T> void print(const T& t){ cout << t << '\n'; }
template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }
template<class... T> void fin(const T&... a) { print(a...); exit(0); }
const string yes[] = {"no","yes"};
const string Yes[] = {"No","Yes"};
const string YES[] = {"NO","YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

template<typename T>
class BIT {
    int n;
    vector<T> val;
public:
    BIT(int n) : n(n), val(n + 1, 0) {}
    
    void add(int i, T x = 1) {
        i++;
        while (i <= n) {
            val[i] += x;
            i += i & -i;
        }
    }
    
    T sum(int i) {
        T ret = 0;
        i++;
        while (i > 0) {
            ret += val[i];
            i -= i & -i;
        }
        return ret;
    }
    
    // [l,r)
    T sum(int l, int r) { return sum(r - 1) - sum(l - 1); }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cout << boolalpha << fixed << setprecision(15);
    INT(n, q);
    vi a(n);
    cin >> a;
    vl sum(n + 1);
    rep(i, n) sum[i + 1] = sum[i] + a[i];
    vi nx(n);
    rep(i, n) nx[i] = i + 1;
    BIT<int> bt(n);
    rep(i, n) bt.add(i);
    auto pos = [&](int i) {
        int ok = n, ng = -1;
        auto f = [&](int x) -> bool {
            return bt.sum(x) >= i + 1;
        };
        while (abs(ok - ng) > 1) {
            int mid = (ng + ok) / 2;
            if (f(mid)) ok = mid;
            else ng = mid;
        }
        return ok;
    };
    while (q--) {
        INT(t, l, r);
        l--;
        if (t == 1) {
            int s = pos(l), f = pos(r);
            int now = nx[s];
            while (now < f) {
                bt.add(now, -1);
                now = nx[now];
            }
            nx[s] = f;
        } else {
            int s = pos(l), f = pos(r);
            cout << sum[f] - sum[s] << endl;
        }
    }
}
0