제출 #1229882

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1229882		Sir_Ahmed_Imran	Zalmoxis (BOI18_zalmoxis)	C++17	100 / 100	360 ms	45672 KiB

zalmoxis

            //    01001100 01001111 01010100 01000001    \\
            //                                           \\
            //                ╦  ╔═╗╔╦╗╔═╗               \\
            //                ║  ║ ║ ║ ╠═╣               \\
            //                ╩═╝╚═╝ ╩ ╩ ╩               \\
            //                                           \\
            //    01001100 01001111 01010100 01000001    \\

#include <bits/stdc++.h>
using namespace std;
#define N 1000002
#define nl '\n'
#define ff first
#define ss second
#define ll long long
#define ld long double
#define terminator main
#define pll pair<ll,ll>
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

int s[N];
int a[N];
int r[N];
vector<int> x[N];

void solve(){
    int n, k, p;
    cin >> n >> k;
    a[n + 1] = 30;
    priority_queue<pii, vector<pii>, greater<pii>> Q;
    for(int i = 1; i <= n; i++){
        cin >> s[i];
        a[i] = s[i];
        r[i] = i + 1;
        Q.push({a[i], i});
    }
    while(Q.top().ff != 30){
        p = Q.top().ss;
        Q.pop();
        if(a[p] == a[r[p]]){
            Q.pop();
            r[p] = r[r[p]];
        }
        else{
            k--;
            x[r[p] - 1].append(a[p]);
        }
        a[p]++;
        Q.push({a[p], p});
    }
    deque<int> d;
    for(int i = 1; i <= n; i++){
        cout << s[i] << ' ';
        for(auto & j : x[i])
            d.append(j);
        x[i].clear();
        while(!d.empty()){
            while(k > 0 && d.front() > 0){
                p = d.front();
                d.pop_front();
                d.push_front(p - 1);
                d.push_front(p - 1);
                k--;
            }
            cout << d.front() << ' ';
            d.pop_front();
        }
    }
}

int terminator(){
    L0TA;
    solve();
    return 0;
}

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70