oj.uz

Submission #750125

# Submission time Handle Problem Language Result Execution time Memory
750125 2023-05-29T07:00:36 Z vqpahmad Zalmoxis (BOI18_zalmoxis) C++14
45 / 100
 407 ms 104236 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define endl '\n'
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mod = 1e9 + 7;
const int N = 1e6 + 15;
const ll inf = 1e18;

int n,k;
vector<pii> ans;
int cnt = 0;
void pr(int o){
    if (k>0&&o>0){
        k--;
        pr(o-1);
        pr(o-1);
        return ;
    }
    cnt++;
    cout << o << ' ';
}
int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin >> n >> k;
    stack<int> st;
    st.push(100);
    vector<int> a(n);
    map<int,vector<int>> mp;
    for (int i=0;i<n;i++){
        int x;
        cin >> x;
        a[i] = x;
        if (x < st.top()){
            st.push(x);
            continue;
        }
        if (x > st.top()){
            while (x > st.top()){
                int u = st.top();
                mp[i-1].pb(u);
                while (u==st.top()){
                    st.pop();
                    u++;
                }
                st.push(u);
            }
        }
        if (x==st.top()){
            int u = st.top();
            while (u==st.top()){
                st.pop();
                u++;
            }
            st.push(u);
        }
    }
    while (st.top()!=30){
        int u = st.top();
        mp[n-1].pb(u);
        while (u==st.top()){
            st.pop();
            u++;
        }
        st.push(u);
    }
    for (int i=0;i<n;i++){
        ans.push_back({a[i],0});
        for (auto it : mp[i]) {
            ans.push_back({it,1});
            k--;
        }
    }
    while (st.size()) st.pop();
    n = sz(ans);
    st.push(ans[0].F);
    for (int i=1;i<n;i++){
        int u = ans[i].F;
        while (st.size()&&u==st.top()){
            st.pop();
            u++;
        }
        st.push(u);
    }
//    assert(st.top() == 30 && st.size()==1);
    for (int i=0;i<n;i++){
        if (ans[i].S==0){
            cout << ans[i].F << ' ';
        }
        else pr(ans[i].F);
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 104236 KB Output is correct
2 Correct 387 ms 104132 KB Output is correct
3 Correct 396 ms 104232 KB Output is correct
4 Correct 397 ms 104216 KB Output is correct
5 Correct 401 ms 104160 KB Output is correct
6 Correct 401 ms 104136 KB Output is correct

Subtask #2
15.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 407 ms 104108 KB not a zalsequence
2 Incorrect 344 ms 104212 KB Expected EOF
3 Incorrect 350 ms 104148 KB Expected EOF
4 Incorrect 401 ms 104088 KB not a zalsequence
5 Incorrect 405 ms 104168 KB not a zalsequence
6 Incorrect 391 ms 104084 KB not a zalsequence
7 Incorrect 399 ms 104088 KB not a zalsequence
8 Incorrect 402 ms 104136 KB not a zalsequence
9 Incorrect 302 ms 90740 KB not a zalsequence
10 Incorrect 167 ms 38296 KB not a zalsequence
11 Incorrect 224 ms 60196 KB not a zalsequence
12 Correct 72 ms 2232 KB Output is correct
13 Correct 86 ms 2308 KB Output is correct
14 Correct 69 ms 2296 KB Output is correct