# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
60795 | alenam0161 | Zalmoxis (BOI18_zalmoxis) | C++17 | 450 ms | 10816 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
void fl();
using namespace std;
const int N = 1000000+7;
int a[N];
stack<int> st;
vector<int> ans;
void rem(){
while(st.size()>=2){
int z=st.top();
st.pop();
if(z==st.top()){
st.pop();
st.push(z+1);
}
else{
st.push(z);
break;
}
}
}
int n,k;
void rek(int x){
if(!x||k<=1){
ans.push_back(x);
return;
}
k--;
rek(x-1);
rek(x-1);
}
int main(){
// fl();
scanf("%d %d",&n,&k);
for(int i=0;i<n;++i){
scanf("%d",a+i);
}
int s=k;
st.push(a[0]);
ans.push_back(a[0]);
for(int i=1;i<n;++i){
while(a[i]>st.top()){
int x=st.top();
ans.push_back(x);
st.push(x);
rem();
k--;
}
ans.push_back(a[i]);
st.push(a[i]);
rem();
}
while(st.size()!=1){
ans.push_back(st.top());
st.push(st.top());
rem();
k--;
}
int z=st.top();
while(k>0){
ans.push_back(z);
z++;
k--;
st.pop();
st.push(z);
if(z>30)break;
}
if(k>1)
rek(st.top());
if(ans.size()!=s+n){
assert(0);
}
for(int i=0;i<ans.size();++i){
printf("%d ",ans[i]);
}
return 0;
}
void fl(){
freopen("input.txt","r",stdin);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |