提出 #33693690

---

ソースコード 拡げる

#include <bits/extc++.h>

int main(){
    using namespace std;
    unsigned long N, K;
    cin >> N >> K;

    const auto simulation{[](auto&& p, unsigned long K){
        vector<pair<unsigned long, unsigned long>> sim_stack;
        p.emplace_back();
        
        unsigned long remain_op = K;
        
        for(const auto& i : p){
            while(!empty(sim_stack) && remain_op >= sim_stack.back().second && sim_stack.back() > i){
                remain_op -= sim_stack.back().second;
                sim_stack.pop_back();
            }
            sim_stack.emplace_back(i);
        }
        sim_stack.pop_back();
        p.pop_back();
        
        vector<unsigned long> ret(size(sim_stack));
        transform(begin(sim_stack), end(sim_stack), begin(ret), [](auto&& i){return i.first;});
        
        return ret;
    }};

    vector<pair<unsigned long, unsigned long>> p(N, {1, 1});
    for(auto&& [i, _] : p)cin >> i;

    auto p_rotated = p;
    const unsigned long front_idx = min_element(begin(p) + N - K, end(p)) - begin(p);
    for(auto i = front_idx; i < N; ++i)p_rotated[i].second = 0;
    rotate(begin(p_rotated), begin(p_rotated) + front_idx, end(p_rotated));
    
    const auto ans = min(simulation(p, K), simulation(p_rotated, K - N + front_idx));
    for(const auto i : ans)cout << i << " ";
    cout << endl;

    return 0;
}

提出情報

ジャッジ結果