# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
750263 | MuntherCarrot | Zalmoxis (BOI18_zalmoxis) | C++14 | 138 ms | 59248 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 ll long long
// #define int long long
#define endl '\n'
#define all(x) x.begin(),x.end()
const ll MOD = 1e9 + 7, SZ = 1e5 + 10, INF = 1e18;
int n, k;
int arr[1000069];
vector<int> ans;
int i = 0;
void solve(int x){
if(ans.size() >= n){
if(ans.size() < n + k){
ans.push_back((n + k - ans.size() == 1 ? x : x - 1));
if(ans.size() < n + k)
solve(x - 1);
}
return;
}
if(arr[i] > x){
ans.push_back(x);
}
else if(arr[i] < x){
solve(x - 1);
solve(x - 1);
return;
}
else{
ans.push_back(x);
i++;
}
}
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k;
for(int i=0;i<n;i++)
cin >> arr[i];
solve(30);
for(int 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... |