Submission #862099

#TimeUsernameProblemLanguageResultExecution timeMemory
862099iskhakkutbilimZalmoxis (BOI18_zalmoxis)C++17
0 / 100
1088 ms10468 KiB
#include "bits/stdc++.h"
 
using namespace std;
 
#define int long long
 int n;
int k;
vector <int> ans;
vector <int> a;
 
int cur;
 
void f(int x) {
	if(x <= 0) return;
	if(cur >= n or a[cur] >= x){
		ans.push_back(x);
		if(cur < n && a[cur] == x) cur++;
	}else{
		f(x-1);
		f(x-1);
	}
////	if(a.size() == 0) {
////		ans.push_back({v, 1});
////		return;
////	}
////	if(v == a.back()) {
////		ans.push_back({v,0});
////		a.pop_back();
////		return;
////	}
////	if(a.back() > v) {
////		ans.push_back({v,1});
////		return;
////	}
//	f(v-1);
//	f(v-1);
}
 
signed 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;
		a.push_back(x);
	}
	cur = 0;
//	reverse(a.begin(), a.end());
 
	f(30);
	for(int x : ans) cout << x << ' ';
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...