oj.uz

Submission #756410

# Submission time Handle Problem Language Result Execution time Memory
756410 2023-06-11T16:50:03 Z sheldon Zalmoxis (BOI18_zalmoxis) C++14
30 / 100
 171 ms 11292 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]);
    }
    for (int i = 1; i < st.size(); ++i) {
        assert(st[i - 1] > st[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();
}

Compilation message

zalmoxis.cpp: In function 'void solve()':
zalmoxis.cpp:38:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for (int i = 1; i < st.size(); ++i) {
      |                     ~~^~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 10356 KB Output is correct
2 Correct 126 ms 10376 KB Output is correct
3 Correct 129 ms 10300 KB Output is correct
4 Correct 123 ms 10304 KB Output is correct
5 Correct 142 ms 10328 KB Output is correct
6 Correct 139 ms 10256 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 128 ms 10328 KB not a zalsequence
2 Incorrect 171 ms 10364 KB not a zalsequence
3 Incorrect 130 ms 10412 KB not a zalsequence
4 Incorrect 151 ms 10376 KB not a zalsequence
5 Incorrect 132 ms 10332 KB not a zalsequence
6 Incorrect 130 ms 10328 KB not a zalsequence
7 Incorrect 142 ms 10300 KB not a zalsequence
8 Incorrect 126 ms 10332 KB not a zalsequence
9 Incorrect 155 ms 9964 KB not a zalsequence
10 Incorrect 97 ms 10428 KB not a zalsequence
11 Incorrect 99 ms 10212 KB not a zalsequence
12 Incorrect 85 ms 11252 KB not a zalsequence
13 Incorrect 84 ms 11260 KB not a zalsequence
14 Incorrect 85 ms 11292 KB not a zalsequence