oj.uz

Submission #756411

# Submission time Handle Problem Language Result Execution time Memory
756411 2023-06-11T16:52:18 Z sheldon Zalmoxis (BOI18_zalmoxis) C++14
30 / 100
 138 ms 11384 KB 
#include <bits/stdc++.h>

using namespace std;

void solve() {
    // ifstream cin ("zalmoxis.in");
    // ofstream cout ("zalmoxis.out");
    int n, k;
    cin >> n >> k;
    vector<int> st = {(int) 1e9};
    vector<int> a(n), ans;
    int done = 0;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        if (a[i] == st.back()) {
            st.push_back(a[i]);
            while (st.size() > 1 && st.back() == st[st.size() - 2]) {
                st.pop_back();
                st.back()++;
            }
        } else if (a[i] > st.back()) {
            while (a[i] >= st.back()) {
                ans.push_back(st.back());
                ++done;
                st.back()++;
                while (st.size() > 1 && st.back() == st[st.size() - 2]) {
                    st.pop_back();
                    st.back()++;
                }
            }
            --done;
            ans.pop_back();
        } else {
            st.push_back(a[i]);
        }
        ans.push_back(a[i]);
    }
    while (st.size() != 2) {
        ans.push_back(st.back());
        st.push_back(st.back());
        ++done;
        while (st.size() > 1 && st.back() == st[st.size() - 2]) {
            st.pop_back();
            st.back()++;
        }
    }
    for (int it = st[1]; it < st[1] + k - done; ++it) {
        ans.push_back(it);
    }
    for (int x : ans) cout << x << ' ';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 10284 KB Output is correct
2 Correct 129 ms 10444 KB Output is correct
3 Correct 129 ms 10292 KB Output is correct
4 Correct 138 ms 10376 KB Output is correct
5 Correct 138 ms 10304 KB Output is correct
6 Correct 129 ms 10276 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 132 ms 10264 KB not a zalsequence
2 Incorrect 129 ms 10348 KB not a zalsequence
3 Incorrect 128 ms 10384 KB not a zalsequence
4 Incorrect 138 ms 10320 KB not a zalsequence
5 Incorrect 130 ms 10300 KB not a zalsequence
6 Incorrect 136 ms 10464 KB not a zalsequence
7 Incorrect 138 ms 10320 KB not a zalsequence
8 Incorrect 128 ms 10356 KB not a zalsequence
9 Incorrect 129 ms 9980 KB not a zalsequence
10 Incorrect 93 ms 10556 KB not a zalsequence
11 Incorrect 105 ms 10252 KB not a zalsequence
12 Incorrect 87 ms 11208 KB not a zalsequence
13 Incorrect 80 ms 11164 KB not a zalsequence
14 Incorrect 80 ms 11384 KB not a zalsequence