722D - Generating Sets - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define YN(result) (result)? cout<<"YES\n" : cout<<"NO\n";
typedef long long int ll;
long long int const MOD = 1e9 + 7;
int const N = 2e5 + 7;

void solve()
{
    int n; cin >> n;
    vector <ll> v(n);
    for(auto &x : v) cin >> x;
    set <ll> ans;
    priority_queue <ll> q;
    sort(v.rbegin(), v.rend());
    for(auto x : v){
        ans.insert(x);
        q.push(x);
    }
    ll op = 0;
    while(1){
        ll a = q.top();
        ll b = a;
        int loop = 0;
        while(ans.count(a) != 0 && a > 0){
            if(a & 1) a = (a - 1) / 2;
            else a = a / 2;
            if(a == 0) break;
            if(ans.count(a) == 0) op = 0;
        }
        
        if(a > 0){
            ans.erase(b);
            ans.insert(a);
            q.push(a);
        }
        op++;
        q.pop();
        if(op == 2 * n) break;
    }
    for(auto x : ans){
        cout << x << " ";
    }
    cout << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}