# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
60009 | Kerim | Zalmoxis (BOI18_zalmoxis) | C++17 | 396 ms | 14648 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"
#define MAXN 1000009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
stack<int>st;
int arr[MAXN],k;
void relax(){
while(!st.empty()){
int a=st.top();st.pop();
if(st.empty()){
st.push(a);
break;
}
int b=st.top();
if(a==b){
st.pop();
st.push(a+1);
}
else{
st.push(a);
break;
}
}
}
void solve(int x){
if(!x or !k){
printf("%d ",x);
return;
}
k--;
solve(x-1);
solve(x-1);
}
int main(){
//~ freopen("file.in", "r", stdin);
int n;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d",&arr[i]);
st.push(INF);
vector<PII>ans;
for(int i=1;i<=n;i++){
while(st.top()<arr[i]){
int tmp=st.top();
st.pop();
st.push(tmp+1);
ans.pb(mp(tmp,1));k--;
relax();
}
ans.pb(mp(arr[i],0));
st.push(arr[i]);
relax();
}
while(!st.empty()){
int nd=st.top();st.pop();
if(nd==30)
break;
ans.pb(mp(nd,1));k--;
st.push(nd+1);
relax();
}
tr(it,ans){
if(it->ss==0)
printf("%d ",it->ff);
else
solve(it->ff);
}puts("");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |