結果

問題 No.1000 Point Add and Array Add
ユーザー PachicobuePachicobue
提出日時 2020-02-28 21:43:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 122 ms / 2,000 ms
コード長 8,924 bytes
コンパイル時間 2,005 ms
コンパイル使用メモリ 210,296 KB
実行使用メモリ 14,444 KB
最終ジャッジ日時 2024-10-13 17:09:50
合計ジャッジ時間 4,624 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 1 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 3 ms
5,248 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 80 ms
12,992 KB
testcase_17 AC 64 ms
9,088 KB
testcase_18 AC 110 ms
14,232 KB
testcase_19 AC 106 ms
14,440 KB
testcase_20 AC 82 ms
14,400 KB
testcase_21 AC 122 ms
14,416 KB
testcase_22 AC 96 ms
14,432 KB
testcase_23 AC 120 ms
14,444 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// created [2020/02/28] 21:29:02
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T>
using max_heap = std::priority_queue<T>;
template<typename T>
using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

int out() { return 0; }
template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
int outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }

template<typename OpMonoid>
class dualseg
{
public:
    using operator_monoid_type = OpMonoid;
    using operator_type        = typename operator_monoid_type::operator_type;
    dualseg(const usize sz, const operator_type& initial = operator_monoid_type::id()) : sz{sz}, depth{clog(sz)}, half{static_cast<usize>(1) << depth}, op(half << 1, operator_monoid_type::id())
    {
        if (initial != operator_monoid_type::id()) { std::fill(op.begin() + half, op.end(), initial); }
    }
    template<typename InIt>
    dualseg(const InIt first, const InIt last) : sz{static_cast<usize>(std::distance(first, last))}, depth{clog(sz)}, half{static_cast<usize>(1) << depth}, op(half << 1, operator_monoid_type::id()) { std::copy(first, last, op.begin() + half); }
    operator_type get(const usize a) const
    {
        assert(a < sz);
        operator_type ans = operator_monoid_type::id();
        for (usize i = 0; i <= depth; i++) { ans = operator_monoid_type::compose(ans, op[(a + half) >> (depth - i)]); }
        return ans;
    }
    void set(usize a, const operator_type& f)
    {
        assert(a < sz);
        clean(a += half), clean(a + 1), op[a] = f;
    }
    void act(usize L, usize R, const operator_type& f)
    {
        assert(L < R), assert(R <= sz);
        clean(L += half), clean(R += half);
        for (; L < R; L >>= 1, R >>= 1) {
            if (L & 1) { update(L++, f); }
            if (R & 1) { update(--R, f); }
        }
    }
    usize size() const { return sz; }
    friend std::ostream& operator<<(std::ostream& os, const dualseg& seg)
    {
        os << "[";
        for (usize i = 0; i < seg.sz; i++) { os << seg.get(i) << (i + 1 == seg.sz ? "" : ","); }
        return (os << "]\n");
    }

private:
    void down(const usize a) { update(a << 1, op[a]), update(a << 1 | 1, op[a]), op[a] = operator_monoid_type::id(); }
    void clean(const usize a)
    {
        const usize b = (a / (a & -a)) >> 1;
        for (usize i = 0; i < depth; i++) {
            const usize v = a >> (depth - i);
            if (v > b) { break; }
            down(v);
        }
    }
    void update(const usize a, const operator_type& f) { op[a] = operator_monoid_type::compose(f, op[a]); }
    const usize sz, depth, half;
    std::vector<operator_type> op;
};
template<typename Element>
struct plus
{
    using element_type  = Element;
    using operator_type = element_type;
    plus()              = delete;
    static operator_type compose(const operator_type& a, const operator_type& b) { return a + b; }
    static constexpr operator_type id() { return operator_type{}; }
};
int main()
{
    const auto N = in<int>(), Q = in<int>();
    auto as = in_v<ll>({N});
    std::vector<bool> is_as(Q);
    std::vector<int> xs(Q);
    std::vector<int> ys(Q);
    for (int i = 0; i < Q; i++) {
        const auto c = in<char>();
        const auto x = in<int>() - 1;
        const auto y = in<int>();
        is_as[i] = c == 'A', xs[i] = x, ys[i] = y;
    }
    std::vector<int> ps(N + 1, 0);
    for (int q = 0; q < Q; q++) {
        if (is_as[q]) { continue; }
        const int x = xs[q], y = ys[q];
        ps[x]++, ps[y]--;
    }
    for (int i = 1; i <= N; i++) { ps[i] += ps[i - 1]; }
    SHOW(ps);

    std::vector<ll> ans(N, 0LL);
    for (int i = 0; i < N; i++) { ans[i] = (ll)ps[i] * as[i]; }
    dualseg<plus<ll>> seg(N);
    for (int q = 0; q < Q; q++) {
        const bool is_a = is_as[q];
        const int x = xs[q], y = ys[q];
        if (is_a) {
            ans[x] += (ll)y * (ps[x] - seg.get(x));
        } else {
            seg.act(x, y, 1);
        }
    }
    outln(ans);
    return 0;
}
0