結果

問題 No.789 範囲の合計
ユーザー AC2KAC2K
提出日時 2023-08-03 00:41:46
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 254 ms / 1,000 ms
コード長 5,856 bytes
コンパイル時間 1,297 ms
コンパイル使用メモリ 98,856 KB
実行使用メモリ 24,932 KB
最終ジャッジ日時 2024-10-12 22:45:49
合計ジャッジ時間 3,855 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 213 ms
22,560 KB
testcase_03 AC 36 ms
5,248 KB
testcase_04 AC 254 ms
22,868 KB
testcase_05 AC 190 ms
22,428 KB
testcase_06 AC 204 ms
22,452 KB
testcase_07 AC 55 ms
5,248 KB
testcase_08 AC 195 ms
24,424 KB
testcase_09 AC 183 ms
23,016 KB
testcase_10 AC 159 ms
14,368 KB
testcase_11 AC 221 ms
24,932 KB
testcase_12 AC 238 ms
24,680 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "a.cpp"
#include <unordered_map>
#line 2 "library/src/stream.hpp"
#include <ctype.h>
#include <stdio.h>
#include <string>
#line 2 "library/src/internal/type_traits.hpp"
#include <iostream>
#include <limits>
#include <numeric>
#include <typeinfo>
namespace kyopro {
namespace internal {
/*
 * @ref https://qiita.com/kazatsuyu/items/f8c3b304e7f8b35263d8
 */
template <typename... Args> struct first_enabled {};

template <typename T, typename... Args>
struct first_enabled<std::enable_if<true, T>, Args...> {
    using type = T;
};
template <typename T, typename... Args>
struct first_enabled<std::enable_if<false, T>, Args...>
    : first_enabled<Args...> {};
template <typename T, typename... Args> struct first_enabled<T, Args...> {
    using type = T;
};

template <typename... Args>
using first_enabled_t = typename first_enabled<Args...>::type;

template <int dgt> struct int_least {
    static_assert(dgt <= 128);
    using type = first_enabled_t<std::enable_if<dgt <= 8, __int8_t>,
                                 std::enable_if<dgt <= 16, __int16_t>,
                                 std::enable_if<dgt <= 32, __int32_t>,
                                 std::enable_if<dgt <= 64, __int64_t>,
                                 std::enable_if<dgt <= 128, __int128_t> >;
};
template <int dgt> struct uint_least {
    static_assert(dgt <= 128);
    using type = first_enabled_t<std::enable_if<dgt <= 8, __uint8_t>,
                                 std::enable_if<dgt <= 16, __uint16_t>,
                                 std::enable_if<dgt <= 32, __uint32_t>,
                                 std::enable_if<dgt <= 64, __uint64_t>,
                                 std::enable_if<dgt <= 128, __uint128_t> >;
};

template <int dgt> using int_least_t = typename int_least<dgt>::type;
template <int dgt> using uint_least_t = typename uint_least<dgt>::type;

template <typename T>
using double_size_uint_t = uint_least_t<2 * std::numeric_limits<T>::digits>;

template <typename T>
using double_size_int_t = int_least_t<2 * std::numeric_limits<T>::digits>;

struct modint_base {};
template <typename T> using is_modint = std::is_base_of<modint_base, T>;
template <typename T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;


// is_integral
template <typename T>
using is_integral_t =
    std::enable_if_t<std::is_integral_v<T> || std::is_same_v<T, __int128_t> ||
                   std::is_same_v<T, __uint128_t>>;
};  // namespace internal
};  // namespace kyopro
#line 6 "library/src/stream.hpp"

namespace kyopro {
// read
void single_read(char& c) {
    c = getchar_unlocked();
    while (isspace(c)) c = getchar_unlocked();
}
template <typename T, internal::is_integral_t<T>* = nullptr>
void single_read(T& a) {
    a = 0;
    bool is_negative = false;
    char c = getchar_unlocked();
    while (isspace(c)) {
        c = getchar_unlocked();
    }
    if (c == '-') is_negative = true, c = getchar_unlocked();
    while (isdigit(c)) {
        a = 10 * a + (c - '0');
        c = getchar_unlocked();
    }
    if (is_negative) a *= -1;
}
template <typename T, internal::is_modint_t<T>* = nullptr>
void single_read(T& a) {
    long long x;
    single_read(x);
    a = T(x);
}
void single_read(std::string& str) {
    char c = getchar_unlocked();
    while (isspace(c)) c = getchar_unlocked();
    while (!isspace(c)) {
        str += c;
        c = getchar_unlocked();
    }
}
template<typename T>
void read(T& x) {single_read(x);}
template <typename Head, typename... Tail>
void read(Head& head, Tail&... tail) {
    single_read(head), read(tail...);
}

// write
void single_write(char c) { putchar_unlocked(c); }
template <typename T, internal::is_integral_t<T>* = nullptr>
void single_write(T a) {
    if (!a) {
        putchar_unlocked('0');
        return;
    }
    if (a < 0) putchar_unlocked('-'), a *= -1;
    char s[37];
    int now = 37;
    while (a) {
        s[--now] = (char)'0' + a % 10;
        a /= 10;
    }
    while (now < 37) putchar_unlocked(s[now++]);
}
template <typename T, internal::is_modint_t<T>* = nullptr>
void single_write(T a) {
    single_write(a.val());
}

void single_write(const std::string& str) {
    for (auto c : str) {
        putchar_unlocked(c);
    }
}

template<typename T>
void write(T x) { single_write(x); }
template <typename Head, typename... Tail> void write(Head head, Tail... tail) {
    single_write(head);
    putchar_unlocked(' ');
    write(tail...);
}
template <typename... Args> void put(Args... x) {
    write(x...);
    putchar_unlocked('\n');
}
};  // namespace kyopro

/**
 * @brief fastIO
 */
#line 3 "a.cpp"
namespace kyopro {

template <typename Key, typename T, int USE = 1 << 20> class dynamic_BIT {
    std::unordered_map<Key, T> bit;
    int n;

public:
    dynamic_BIT(Key n = std::numeric_limits<Key>::max() / 2) : n(n) {}
    void add(Key p, T w) {
        p++;
        for (Key x = p; x <= n; x += x & -x) {
            auto it = bit.find(x);
            if (it != bit.end()) {
                it->second += w;
            } else {
                bit[x] = w;
            }
        }
    }

    T sum(Key p) const {
        T s = 0;

        for (Key x = p; x > 0; x -= x & -x) {
            auto p = bit.find(x);
            if (p != bit.end()) s += p->second;
        }
        return s;
    }

    T sum(Key l, Key r) const { return sum(r) - sum(l); }
};

};  // namespace kyopro

int main() {
    const int n = 1000001;
    kyopro::dynamic_BIT<int, int, n> seg;

    int q;
    kyopro::read(q);
    long long ans = 0;
    while (q--) {
        int type;
        kyopro::read(type);
        if (!type) {
            int x;
            long long y;
            kyopro::read(x, y);
            seg.add(x, y);
        } else {
            int l, r;
            kyopro::read(l, r);
            ans += seg.sum(l, r + 1);
        }
    }
    kyopro::put(ans);
}
0