Submission #278134

#TimeUsernameProblemLanguageResultExecution timeMemory
278134test2Zalmoxis (BOI18_zalmoxis)C++14
0 / 100
77 ms5556 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 dfs(int x , int val){ if(a[x] > val){ cout<< val <<" " ; return x ; } if(!val)return n ; if(a[x] == val){ cout<< val <<" " ; return x + 1 ; } int ret1 = dfs(x , val - 1) ; if(ret1 == n) return n; int ret2 = dfs(ret1 , val -1 ) ; if(ret2 == ret1){ //cout<< val <<" " ; } return ret2 ; } int main(){ ios_base::sync_with_stdio(0) ; cin.tie(0) ; //freopen("in.in", "r" , stdin) ; cin >> n >> k ; 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...