結果

問題 No.3221 Count Turns
ユーザー nono00
提出日時 2025-08-01 22:22:49
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 69 ms / 2,000 ms
コード長 5,464 bytes
コンパイル時間 2,948 ms
コンパイル使用メモリ 284,768 KB
実行使用メモリ 12,864 KB
最終ジャッジ日時 2025-08-01 22:22:55
合計ジャッジ時間 5,757 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bit>
#include <cassert>
#include <vector>

namespace nono {

///  brief : 一点更新 区間取得のsegment tree. <https://atcoder.github.io/ac-library/master/document_ja/segtree.html>
template <class M>
class SegmentTree {
    using T = M::Value;

  public:
    SegmentTree(): SegmentTree(0) {}
    explicit SegmentTree(int n): SegmentTree(std::vector<T>(n, M::e())) {}
    explicit SegmentTree(const std::vector<T>& v): n_(int(v.size())) {
        size_ = std::bit_ceil((unsigned int)(n_));
        log_ = std::countr_zero((unsigned int)size_);
        data_ = std::vector<T>(2 * size_, M::e());
        for (int i = 0; i < n_; i++) data_[size_ + i] = v[i];
        for (int i = size_ - 1; i >= 1; i--) {
            update(i);
        }
    }

    ///  # set(p, x)
    ///  data[p] <= x
    ///  O(logn)
    void set(int p, T x) {
        assert(0 <= p && p < n_);
        p += size_;
        data_[p] = x;
        for (int i = 1; i <= log_; i++) update(p >> i);
    }

    ///  # get(p)
    ///  return data[p]
    ///  O(logn)
    T get(int p) const {
        assert(0 <= p && p < n_);
        return data_[p + size_];
    }

    ///  # prod(l, r)
    ///  return op[for i in [l, r)](data[i])
    ///  O(logn)
    T prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= n_);
        T sml = M::e(), smr = M::e();
        l += size_;
        r += size_;

        while (l < r) {
            if (l & 1) sml = M::op(sml, data_[l++]);
            if (r & 1) smr = M::op(data_[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return M::op(sml, smr);
    }

    ///  # all_prod()
    ///  O(1)
    T all_prod() const {
        return data_[1];
    }

    ///  # apply(p, f)
    ///  data[p] <= mapping(f, data[p])
    ///  O(logn)
    template <class F>
    int max_right(int l, F f) const {
        assert(0 <= l && l <= n_);
        assert(f(M::e()));
        if (l == n_) return n_;
        l += size_;
        T sm = M::e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(M::op(sm, data_[l]))) {
                while (l < size_) {
                    l = (2 * l);
                    if (f(M::op(sm, data_[l]))) {
                        sm = M::op(sm, data_[l]);
                        l++;
                    }
                }
                return l - size_;
            }
            sm = M::op(sm, data_[l]);
            l++;
        } while ((l & -l) != l);
        return n_;
    }

    ///  # apply(l, r, f)
    ///  [for i in [l, r)](data[i] <= mapping(f, data[i])
    ///  O(logn)
    template <class F>
    int min_left(int r, F f) const {
        assert(0 <= r && r <= n_);
        assert(f(M::e()));
        if (r == 0) return 0;
        r += size_;
        T sm = M::e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(M::op(data_[r], sm))) {
                while (r < size_) {
                    r = (2 * r + 1);
                    if (f(M::op(data_[r], sm))) {
                        sm = M::op(data_[r], sm);
                        r--;
                    }
                }
                return r + 1 - size_;
            }
            sm = M::op(data_[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int n_, size_, log_;
    std::vector<T> data_;

    void update(int k) {
        data_[k] = M::op(data_[2 * k], data_[2 * k + 1]);
    }
};

}  //  namespace nono

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, vector<T>, greater<T>>;
#define rep2(i, n) for (ll i = 0; i < (n); i++)
#define rep3(i, l, r) for (ll i = (l); i < (r); i++)
#define rrep2(i, n) for (ll i = n; i-- > 0;)
#define rrep3(i, r, l) for (ll i = (r); i-- > (l);)
#define overload(a, b, c, d, ...) d
#define rep(...) overload(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rrep(...) overload(__VA_ARGS__, rrep3, rrep2)(__VA_ARGS__)
#define all(x) begin(x), end(x)
bool chmin(auto& lhs, auto rhs) {
    return lhs > rhs ? lhs = rhs, 1 : 0;
}
bool chmax(auto& lhs, auto rhs) {
    return lhs < rhs ? lhs = rhs, 1 : 0;
}
struct IOIO {
    IOIO() {
        std::cin.tie(0)->sync_with_stdio(0);
    }
} ioio;

constexpr ll inf = 1e18;
struct MinIndex {
    using T = pair<ll, ll>;
    struct Value {
        Value(T value, int index): value(value), index(index) {}
        T value;
        int index;
    };
    static Value op(Value lhs, Value rhs) {
        return (lhs.value <= rhs.value ? lhs : rhs);
    }
    static Value e() {
        return {{inf, inf}, -1};
    }
};

void solve() {
    using M = MinIndex;
    using Segtree = nono::SegmentTree<M>;

    int n;
    ll h;
    int t;
    cin >> n >> h >> t;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    vector<int> c(n);
    Segtree segtree(n);
    rep(i, n) {
        ll num = (h + a[i] - 1) / a[i];
        segtree.set(i, {pair<int, ll>{num, -a[i] * num}, (int)i});
    }
    ll offset = 0;
    rep(i, t) {
        auto res = segtree.all_prod();
        c[res.index]++;
        offset = res.value.first;
        res.value.first = offset + ((h + a[res.index] - 1) / a[res.index]);
        segtree.set(res.index, res);
    }
    rep(i, n) cout << c[i] << " \n"[i + 1 == n];
}

int main() {
    int t = 1;
    //  cin >> t;
    while (t--) solve();
}
0