# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70003 | 3zp | Zalmoxis (BOI18_zalmoxis) | C++14 | 437 ms | 63808 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>
using namespace std;
int a[2000009];
int F[2000009];
stack<int> S;
int sf = 0;
void RR(){
while(S.size() > 1){
int x = S.top(); S.pop();
if(S.top() != x){
S.push(x);
break;
}
S.top() ++;
}
}
vector<int> divide(int x, int mx){
if(mx == 0) return {};
if(mx == 1 || x == 0) {
return {x};
}
if((1<<x) <= mx){
vector<int> ans;
for(int i = 0; i < (1<<x); i++)
ans.push_back(0);
return ans;
}
vector<int> ans1 = divide(x - 1, mx - 1),
ans2 = divide(x - 1, mx - ans1.size());
for(int i = 0; i < ans2.size(); i++)
ans1.push_back(ans2[i]);
return ans1;
}
main(){
vector<int> ans;
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1; i <= n; i++){
if(S.size() == 0){
ans.push_back(a[i]);
S.push(a[i]);
continue;
}
S.push(a[i]);
RR();
ans.push_back(a[i]);
while((i == n && S.size() > 1) || S.top() < a[i+1]){
ans.push_back(S.top());
S.push(S.top());
F[ans.size()-1] = 1;
sf ++;
RR();
}
}
int x = S.top();
for(int i = x; i <= 29; i++)
ans.push_back(i),
F[ans.size()-1] = 1;
vector<int> ANS;
int l = ans.size();
for(int i = 0; i < ans.size(); i++){
if(F[i] == 0)
{
ANS.push_back(ans[i]);
continue;
}
vector<int> X = divide(ans[i], n + k - l + 1);
l += X.size() - 1;
for(int i = 0; i < X.size(); i++)
ANS.push_back(X[i]);
}
for(int i = 0; i < ANS.size(); i++)
cout<<ANS[i] << " ";
cout<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |