# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
861849 | maks007 | Zalmoxis (BOI18_zalmoxis) | C++14 | 110 ms | 12484 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 last;
vector <int> ans, a;
map <int,int> wiped;
void f(int v) {
if(v == a.back()) {
ans.push_back(v);
a.pop_back();
return;
}
if(a.back() > v) {
ans.push_back(v);
return;
}
f(v-1);
f(v-1);
}
signed main () {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k, cnt = 0;
cin >> n >> k;
for(int i = 0; i < n; i ++) {
int x;
cin >> x;
wiped[x] ++;
a.push_back(x);
}
reverse(a.begin(), a.end());
// int need = (1 << 30) - cnt;
// cnt = 0;
// while(need > 1) {
// cnt ++;
// need /= 2;
// }
f(30);
for(auto i : ans) cout << i << " ";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |