# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97262 | MohamedAhmed0 | Zalmoxis (BOI18_zalmoxis) | C++14 | 961 ms | 54464 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 MAX = 2e6 + 10 ;
int idx ;
vector<int>v ;
int n , k ;
vector<int>ans ;
set<int>s ;
void solve(int node , int level)
{
if(level == v[idx])
{
idx++;
ans.push_back(node) ;
return ;
}
solve(node * 2 , level - 1) ;
if(idx == v.size() || level <= v[idx])
{
s.insert(node * 2 + 1) ;
return ;
}
solve(node * 2 + 1 , level - 1) ;
}
void print_solution(int node , int level)
{
if(binary_search(ans.begin() , ans.end() , node))
{
cout<<level<<" ";
return ;
}
print_solution(node * 2 , level - 1) ;
print_solution(node * 2 + 1 , level - 1) ;
}
int main()
{
scanf("%d %d" , &n , &k) ;
for(int i = 0 ; i < n ; ++i)
{
int x ;
scanf("%d" , &x) ;
v.push_back(x) ;
}
solve(1 , 30) ;
while(s.size() < k)
{
int now = *s.begin() ;
s.erase(now) ;
s.insert(now * 2) ;
s.insert(now * 2 + 1) ;
}
for(auto &i : s)
ans.push_back(i) ;
sort(ans.begin() , ans.end()) ;
return print_solution(1 , 30) , 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |