Submission #1212373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1212373		countless	Nile (IOI24_nile)	C++20	100 / 100	87 ms	13240 KiB

nile

#include "nile.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

const ll MOD = 998244353;
const int INF = 1e9+5;
const ld EPS = 1e-12;

#define endl "\n"
#define sp << " " <<
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);

vector<ll> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) {
    // fixing cause my code is so messy
    
    // pre
    int n = w.size(), q = e.size();
    ll base = accumulate(all(b), 0LL), diff = 0;

    // dec
    vector<int> p(n), s(n, 1), c(n), o(n);
    vector<array<int, 3>> m(n, {INF, INF, INF});
    vector<ll> r(q);
    vector<pair<int, pair<int, int>>> st;
    
    // helpe
    auto eval = [&](int i, int j) -> int {
        return abs(w[o[i]] - w[o[j]]);
    };

    auto cost = [&](int i) -> int {
        return (s[i] % 2 ? min(m[i][2], m[i][i % 2]) : 0);
    };

    auto find = [&](auto &&find, int u) -> int {
        if (u == p[u]) return u;
        return p[u] = find(find, p[u]);
    };

    auto unite = [&](int u, int v) -> void {
        u = find(find, u), v = find(find, v);

        if (u == v) return;

        diff -= cost(u);
        diff -= cost(v);

        p[v] = u;
        s[u] += s[v];

        REP(i, 0, 3) m[u][i] = min(m[u][i], m[v][i]);

        diff += cost(u);
        return;
    };

    auto adjust = [&](int u) -> void {
        int v = find(find, u);
        diff -= cost(v);
        m[v][2] = min(m[v][2], c[o[u]]);
        diff += cost(v);
    };

    // proc
    REP(i, 0, n) c[i] = a[i] - b[i];
    iota(all(o), 0), iota(all(p), 0);
    sort(all(o), [&](const int i, const int j) -> bool {
        return w[i] < w[j];
    });

    REP(i, 0, n) {
        if (i < n-1) st.push_back({eval(i, i+1), {0, i}});
        if (i < n-2) st.push_back({eval(i, i+2), {1, i+1}});

        m[i][i % 2] = c[o[i]];
        diff += cost(i);
    }

    REP(i, 0, q) {
        st.push_back({e[i], {2, i}});
    }

    sort(all(st));

    // comp
    for (auto [x, y] : st) {
        int t = y.fi;
        int z = y.se;

        if (t == 0) {
            unite(z, z+1);
        } else if (t == 1) {
            adjust(z);
        } else {
            r[z] = base + diff;
        }
    }

    return r;
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 13 / 13
• Subtask 3: 17 / 17
• Subtask 4: 11 / 11
• Subtask 5: 20 / 20
• Subtask 6: 15 / 15
• Subtask 7: 18 / 18