# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
861793 | iskhakkutbilim | Zalmoxis (BOI18_zalmoxis) | C++17 | 1103 ms | 48880 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;
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
int n, k;
vector<pair<int, int> > ans;
multiset<int> st;
void f(int x, int depth){
// cout << x << ' ' << depth << '\n';
if(x < 0) assert(false);
int mn = (st.empty() ? INT_MAX : *st.begin());
if(x > mn){
f(x-1, depth + 1);
f(x-1, depth + 1);
}else{
ans.push_back({x, depth});
if(st.count(x))
st.erase(st.find(x));
}
}
main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> k;
for(int i = 0;i < n; i++){
int x; cin >> x;
st.insert(x);
}
f(30, 0);
if(ans.size() != (n + k)){
assert(false);
}else{
for(auto [x, y] : ans) cout << x << ' ';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |