# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335435 | 3funnn | Zalmoxis (BOI18_zalmoxis) | C++17 | 720 ms | 40432 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>
#define mp make_pair
#define pii pair <int, int>
using namespace std;
int need;
void dfs(int val){
if (need == 0 || val == 0){
cout << val << " ";
return;
}
--need;
dfs(val - 1);
dfs(val - 1);
}
int main()
{
int N, K;
cin >> N >> K;
vector <pii> a(N, mp(0, 0));
for (int i = 0;i < N;++i)
cin >> a[i].first;
for (int p = 0;p < 30;++p){
vector <pii> b;
for (int i = 0;i < a.size();++i){
if (a[i].first <= p){
int j = i, cnt = 0;
while (j < a.size() && a[j].first <= p){
cnt += (1 << a[j].first);
b.push_back(a[j]);
++j;
}
if ((cnt >> p) & 1)
b.push_back(mp(p, 1));
i = j - 1;
}
else
b.push_back(a[i]);
}
a = b;
}
need = N + K - a.size();
for (int i = 0;i < a.size();++i){
if (a[i].second == 0)
cout << a[i].first << " ";
else
dfs(a[i].first);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |