# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850947 | Charizard2021 | Zalmoxis (BOI18_zalmoxis) | C++17 | 195 ms | 39892 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;
const int N = 1000001;
void solve(int n, int &k){
if(k == 0){
cout << n << " ";
return;
}
k--;
solve(n - 1, k);
solve(n - 1, k);
}
int main(){
int n, k;
cin >> n >> k;
int a[1 + n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
a[n] = 30;
int counter = 0;
vector<int> cur[1 + n];
for(int i = 0; i < n; i++){
counter += (1 << a[i]);
while(__builtin_ctz(counter) < a[i + 1]){
cur[i].push_back(__builtin_ctz(counter));
counter += (counter & (-counter));
k--;
}
}
for(int i = 0;i < n; i++){
cout << a[i] << " ";
for(int j = 0; j < cur[i].size(); j++){
solve(cur[i][j], k);
}
}
cout << "\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |