# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
668179 | MrDeboo | Zalmoxis (BOI18_zalmoxis) | C++17 | 108 ms | 34216 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
deque<int>a,b(n);
for(auto &i:b)cin>>i;
deque<int>doq=b;
deque<int>dq={b[0]};
a.push_back(b[0]);
b.pop_front();
while(b.size()){
if(b[0]<=a.back()){
a.push_back(b[0]);
dq.push_back(b[0]);
b.pop_front();
}else{
k--;
a.push_back(a.back());
dq.push_back(a.back());
}
while(a.size()>1&&a.back()==a[a.size()-2]){
int A=a.back();
a.pop_back();
a.pop_back();
a.push_back(A+1);
}
}
while(a.size()>1){
a.push_back(a.back());
dq.push_back(a.back());
k--;
while(a.size()>1&&a.back()==a[a.size()-2]){
int A=a.back();
a.pop_back();
a.pop_back();
a.push_back(A+1);
}
}
int g=a.back();
while(k--){
dq.push_back(g++);
}
assert(k>=0);
int f=0;
for(int i=0;i<dq.size();i++){
if(f<doq.size()&&doq[f]==dq[i])f++;
}
deque<int>deq;
for(int i=0;i<dq.size();i++){
deq.push_back(dq[i]);
while(deq.size()>1&&deq.back()==deq[deq.size()-2]){
int a=deq.back();
deq.pop_back();
deq.pop_back();
deq.push_back(a+1);
}
}
// assert(deq.size()==1);
for(auto &i:dq)cout<<i<<' ';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |