Submission #67787456

---

Source Code Expand

#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Wpedantic"
#endif

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(52);
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename V>
using table = gp_hash_table<T, V>;

using i128 = __int128;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;

const ll INF = 2e18;
const int inf = 1e9;
const int maxn = 1e5 + 7;
const int MOD = 998244353;
const ld pi = acos(-1);
const int P = 5167;
const int L = 26;
const ld EPS = 0.0005;

template<typename T, typename V>
void fill(T &container, V value) {
    for (auto &c : container)
        c = value;
}

#define int ll

void solve() {
    int n;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; ++i) cin >> v[i];
    vector<pair<int, int> > a;
    for (int i = 0; i < n; ++i) {
        if (i == 0 || v[i] != v[i - 1]) {
            a.push_back({v[i], 0});
        }
        a.back().second++;
    }
    vector<int> val(n), cnt(n);
    set<int> st;
    set<pair<int, int> > st1;
    for (int i = 0; i < a.size(); ++i) {
        val[i] = a[i].first;
        cnt[i] = a[i].second;
        st.insert(i);
        st1.insert({a[i].first, i});
    }
    ll ans = 0;
    while (st.size() > 1) {
        auto pos = st1.begin()->second;
        int num = val[pos], c = cnt[pos];
        auto it = st.lower_bound(pos);
        int Cnt = INF;
        int l = INF, r = INF;
        if (it != st.begin()) {
            auto it1 = it;
            it1--;
            l = val[*it1] - num;
            Cnt = min(Cnt, l);
        }
        it++;
        if (it != st.end()) {
            r = val[*it] - num;
            Cnt = min(Cnt, r);
        }
        while (c > 1 && Cnt > 0) {
            if (c % 2 == 1) {
                ans++;
                c++;
            }
            num++;
            c /= 2;
            Cnt--;
        }
        num += Cnt;
        ans += Cnt;
        if (l <= r) {
            auto it = st.lower_bound(pos);
            it--;
            int dpos = *it;
            st1.erase({val[dpos], dpos});
            st.erase(dpos);
            c += cnt[dpos];
        }
        if (l >= r) {
            auto it = st.lower_bound(pos);
            it++;
            int dpos = *it;
            st1.erase({val[dpos], dpos});
            st.erase(dpos);
            c += cnt[dpos];
        }
        st1.erase({val[pos], pos});
        val[pos] = num;
        cnt[pos] = c;
        st1.insert({val[pos], pos});
    }
    int d = cnt[*st.rbegin()];
    while (d > 1) {
        ans += d % 2;
        d++;
        d /= 2;
    }
    cout << ans << "\n";
}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(7);
    int t = 1;
    cin >> t;
    while (t--) solve();
    //stress();
}

Submission Info

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:59:23: warning: comparison of integer expressions of different signedness: ‘ll’ {aka ‘long long int’} and ‘std::vector<std::pair<long long int, long long int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   59 |     for (int i = 0; i < a.size(); ++i) {
      |                     ~~^~~~~~~~~~

Judge Result