Submission #278168

#TimeUsernameProblemLanguageResultExecution timeMemory
278168test2Zalmoxis (BOI18_zalmoxis)C++14
30 / 100
172 ms10652 KiB
#include<bits/stdc++.h>

#define I inline void 

using namespace std ; 

using ll = long long ; 
using ld = long double ; 

const int N = 2e6 + 7 ; 

// How interesting!

int n , k ; 
int a[N] ; 

int used = 0 ; 

int dfs(int x , int val){
	if(a[x] > val){
		cout<< val <<" " ; 
		used ++ ; 
		assert(used < 2) ; 
		return x ; 
	}
	if(a[x] == val){	
		cout<< val <<" " ; 
		return x + 1 ; 
	}
	int ret1 = dfs(x , val - 1) ; 
	int ret2 = dfs(ret1 , val -1 ) ; 
	return ret2 ;  
}

int main(){
	ios_base::sync_with_stdio(0) ; 
	cin.tie(0) ; 
	//freopen("in.in", "r" , stdin) ;

	cin >> n >> k ; 
	a[n] = (1<<30) ;
	for(int i = 0 ;i < n ; i++){
		cin >> a[i] ; 
	}

	dfs(0 , 30 ) ; 
	return 0 ; 
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...