# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81799 | Plurm | Zalmoxis (BOI18_zalmoxis) | C++11 | 320 ms | 38344 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 main(){
int n,k;
scanf("%d%d",&n,&k);
vector<int> ans;
stack<pair<int,int> > stk;
for(int i = 0; i < n; i++){
int cur;
scanf("%d",&cur);
ans.push_back(cur);
while(!stk.empty() && cur == stk.top().second){
cur++;
stk.pop();
}
stk.emplace(i,cur);
}
int mindex = -1;
int mn = 1e9;
while(!stk.empty()){
auto cur = stk.top();
stk.pop();
if(cur.second < mn){
mn = cur.second;
mindex = cur.first;
}
}
ans.insert(ans.begin() + mindex + 1,mn);
for(auto x : ans){
printf("%d ",x);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |