O(T log n) 做法 TLE 求助

#include <iostream>
#include <cstring>
#include <algorithm>

#define int long long

using namespace std;

const int N = 1e6 + 10;

int T, n;
int pows[35];
bool bits[35];

signed main() {
    // ios::sync_with_stdio(false);
    // cin.tie(nullptr);
    
    pows[0] = 1;
    for (int i = 1; i <= 33; i ++) pows[i] = pows[i - 1] * 2;
    
    cin >> T;
    while (T --) {
        cin >> n;
        int k = 0, t = n;
        while (n) {
            if (n & 1) bits[k ++] = true;
            else bits[k ++] = false;
            n >>= 1;
        }
        
        int sum = 0, b = -1;
        for (int i = k - 1; i >= 0; i --) {
            if (bits[i]) {
                sum += pows[i];
                if (b == -1) b = pows[i];
            } else {
                if (b + pows[i] <= t) sum += pows[i] * 2;
            }
        }
        
        cout << sum << endl;
        // for (int i = 0; i < k; i ++) {
        //     if (bits[i]) cout << 1 << ' ';
        //     else cout << 0 << ' ';
        // }
        // cout << endl;
    }
    
    return 0;
}