提出 #50169550

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>
#include <atcoder/lazysegtree>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

Num func_operate(Num a, Num b) {
    return a + b;
}

Num func_unit() {
    return 0;
}

Num func_map(Num a, Num b) {
    return a + b;
}

Num func_compose(Num a, Num b) {
    return a + b;
}

Num func_id() {
    return 0;
}

void solve(std::istream& is, std::ostream& os) {
    Num n, m;
    is >> n >> m;

    atcoder::lazy_segtree<Num, func_operate, func_unit, Num, func_map, func_compose, func_id> tree(n);
    for(Num i{0}; i<n; ++i) {
        Num a;
        is >> a;
        tree.set(i, a);
    }

    Vec bset(m);
    for(auto&& b : bset) {
        is >> b;
    }

    for(Num i{0}; i<m; ++i) {
        const auto box = bset.at(i);
        auto ct = tree.get(box);
        tree.set(box, 0);
        if (ct == 0) {
            continue;
        }

        Num div = ct / n;
        Num rem = ct % n;
        tree.apply(0, n, div);

        Num left = box + 1;
        Num right = left + rem;
        if (right <= n) {
            tree.apply(left, right, 1);
        } else {
            tree.apply(left, n, 1);
            right %= n;
            tree.apply(0, right, 1);
        }
    }

    for(Num i{0}; i<n; ++i) {
        os << tree.get(i);
        if ((i+1) == n) {
            os << "\n";
        } else {
            os << " ";
        }
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

提出情報

ジャッジ結果