oj.uz

Submission #578606

# Submission time Handle Problem Language Result Execution time Memory
578606 2022-06-17T11:12:57 Z FatihSolak Zalmoxis (BOI18_zalmoxis) C++17
40 / 100
 182 ms 18356 KB 
#include <bits/stdc++.h>
#define N 200005
using namespace std;
vector<int> create(int a,int b){
    if(b == 1){
        return {a};
    }
    auto l = create(a-1,b/2);
    auto r = create(a-1,b-b/2);
    for(auto u:r){
        l.push_back(u);
    }
    return l;
}
void solve(){
    int n,k;
    cin >> n >> k;
    vector<pair<int,int>> v;
    vector<int> now = {30};
    for(int i = 1;i<=n;i++){
        int x;
        cin >> x;
        while(now.back() < x){
            v.push_back({now.back(),1});
            now.pop_back();
        }
        while(now.back() > x){
            int tmp = now.back()-1;
            now.pop_back();
            now.push_back(tmp);
            now.push_back(tmp);
        }
        v.push_back({now.back(),0});
        now.pop_back();
    }
    for(auto u:now){
        v.push_back({u,1});
    }
    vector<int> ans;
    int needed = n + k -  v.size();
    for(auto u:v){
        auto tmp = create(u.first,(u.second?min(1<<u.first,needed+1):1));
        for(auto c:tmp){
            ans.push_back(c);
        }
        needed -= tmp.size() - 1;
    }
    for(auto u:ans){
        cout << u << " ";
    }
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    #ifdef Local
    cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 18356 KB Output is correct
2 Correct 165 ms 18220 KB Output is correct
3 Correct 156 ms 18292 KB Output is correct
4 Correct 178 ms 18152 KB Output is correct
5 Correct 165 ms 18220 KB Output is correct
6 Correct 166 ms 18192 KB Output is correct

Subtask #2
10.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 158 ms 18180 KB not a zalsequence
2 Correct 159 ms 18148 KB Output is correct
3 Correct 159 ms 18220 KB Output is correct
4 Incorrect 159 ms 18176 KB not a zalsequence
5 Incorrect 165 ms 18220 KB not a zalsequence
6 Incorrect 159 ms 18220 KB not a zalsequence
7 Incorrect 182 ms 18152 KB not a zalsequence
8 Incorrect 172 ms 18204 KB not a zalsequence
9 Incorrect 157 ms 17832 KB not a zalsequence
10 Incorrect 142 ms 10540 KB not a zalsequence
11 Incorrect 145 ms 16176 KB not a zalsequence
12 Incorrect 158 ms 10340 KB not a zalsequence
13 Incorrect 138 ms 10376 KB not a zalsequence
14 Incorrect 144 ms 10356 KB not a zalsequence