Submission #579987

#	Time	Username	Problem	Language	Result	Execution time	Memory
579987		loggerr	Birthday gift (IZhO18_treearray)	C++14	56 / 100	3356 ms	262144 KiB

treearray

#include "bits/stdc++.h"

using namespace std;
using ll = int;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
using str = string;
using big_int = __int128_t;

const ld eps = 1e-7;
const ld PI = acos(-1);

#define all(c) (c).begin(), (c).end()
#define rall(c) ((c).rbegin()), ((c).rend())
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define fast ios_base::sync_with_stdio(0); cin.tie(0)
#define forn(i, n) for (ll i = 0; i < n; ++i)
#define sz(a) (ll)a.size()
#define endl '\n'
#define u_map unordered_map
#define mset multiset
//#define x first
//#define y second

#ifdef ONLINE_JUDGE
#define debug(x);
#else
#define debug(x) cerr << #x << ": " << x << endl;
#endif

str IO[2] = {"NO\n", "YES\n"};
str io[2] = {"no\n", "yes\n"};
str Io[2] = {"No\n", "Yes\n"};
//
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnd(1232423);

template<class T> bool inmin(T& x_, T y_) {return y_ < x_ ? (x_ = y_, true) : false;}
template<class T> bool inmax(T& x_, T y_) {return y_ > x_ ? (x_ = y_, true) : false;}

//const ll Mod = 1e9 + 7;
const ll Mod = 998244353;
//const ll Mod = 1e9 + 9;
//const ll Mod = 1234567891;
const ll INF = 1e18;

template<class T> void add(T& x_, T y_) { x_ = (x_ + y_) % Mod; };
template<class T> void sub(T& x_, T y_) { x_ = (x_ + Mod - y_) % Mod; };
template<class T> void mul(T& x_, T y_) { x_ = (x_ * y_) % Mod; };

const ll Maxn = 2e5 + 10;
const ll Lg = 22;

vll gr[Maxn];
ll up[Lg][Maxn];
ll d[Maxn];

void dfs(ll v, ll p) {
    up[0][v] = p;
    d[v] = d[p] + 1;
    for (ll adj : gr[v]) {
        if (adj == p) continue;
        dfs(adj, v);
    }
}

ll la(ll v, ll k) {
    forn (i, Lg) {
        if (k & (1 << i))
            v = up[i][v];
    }
    return v;
}

ll lca(ll u, ll v) {
    if (d[u] < d[v]) swap(u, v);
    u = la(u, d[u] - d[v]);
    if (u == v)
        return u;
    for (ll i = Lg - 1; i >= 0; --i) {
        if (up[i][u] == up[i][v]) continue;
        u = up[i][u], v = up[i][v];
    }
    return up[0][u];
}

const ll C = 2500;

struct block {
    map<ll, set<ll>> keys;
    ll size;

    void erase(ll x, ll key) {
        keys[key].erase(x);
        if (keys[key].empty())
            keys.erase(key);
    }

    void insert(ll x, ll key) {
        keys[key].insert(x);
    }

    ll get(ll key) {
        return (keys[key].empty() ? -1 : *keys[key].begin());
    }
};

inline void solve() {
    ll n, m, q;
    cin >> n >> m >> q;
    forn (i, n - 1) {
        ll u, v;
        cin >> u >> v;
        --u, --v;
        gr[u].pb(v), gr[v].pb(u);
    }
    dfs(0, 0);
    for (ll i = 1; i < Lg; ++i) {
        forn (v, Maxn) {
            up[i][v] = up[i - 1][up[i - 1][v]];
        }
    }
    vll que(m);
    forn (i, m) {
        cin >> que[i];
        --que[i];
    }
    vll lcas(m - 1);
    forn (i, m - 1) {
        lcas[i] = lca(que[i], que[i + 1]);
    }
    vector<block> dcL;
    forn (i, sz(lcas)) {
        ll id = i / C;
        if (id == sz(dcL)) dcL.pb({});
        dcL[id].size++;
        dcL[id].insert(i, lcas[i]);
    }
    vector<block> dcV;
    forn (i, sz(que)) {
        ll id = i / C;
        if (id == sz(dcV)) dcV.pb({});
        dcV[id].size++;
        dcV[id].insert(i, que[i]);
    }
    auto query = [&](ll l, ll r, ll key, vector<block> &dc, vector<ll> &arr) {
        ll id = -1;
        while (l <= r) {
            if (l % C == 0 && l + dc[l / C].size - 1 <= r) {
                ll nid = dc[l / C].get(key);
                if (nid != -1) id = nid;
                l += dc[l / C].size;
            } else {
                if (arr[l] == key) id = l;
                ++l;
            }
        }
        return id;
    };
    while (q--) {
        ll tp;
        cin >> tp;
        if (tp == 1) {
            ll pos, v;
            cin >> pos >> v;
            --pos, --v;
            dcV[pos / C].erase(pos, que[pos]);
            //debug(1);
            if (pos - 1 >= 0) {
                dcL[(pos - 1) / C].erase(pos - 1, lcas[pos - 1]);
            }
            if (pos + 1 < m) {
                dcL[pos / C].erase(pos, lcas[pos]);
            }
            que[pos] = v;
            dcV[pos / C].insert(pos, que[pos]);
            if (pos - 1 >= 0) {
                lcas[pos - 1] = lca(que[pos - 1], que[pos]);
                dcL[(pos - 1) / C].insert(pos - 1, lcas[pos - 1]);
            }
            if (pos + 1 < m) {
                lcas[pos] = lca(que[pos], que[pos + 1]);
                dcL[pos / C].insert(pos, lcas[pos]);
            }
            continue;
        }
        ll l, r, v;
        cin >> l >> r >> v;
        if (v == 4) {
            debug(0)
        }
        --l, --r, --v;
        ll id = query(l, r, v, dcV, que);
        if (id != -1) {
            cout << id + 1 << ' ' << id + 1 << endl;
            continue;
        }
        if (l == r) {
            cout << -1 << ' ' << -1 << endl;
            continue;
        }
        --r;
        id = query(l, r, v, dcL, lcas);
        if (id == -1) {
            cout << -1 << ' ' << -1 << endl;
            continue;
        }
        ll ql = id + 1;
        ll qr = ql + 1;
        cout << ql << ' ' << qr << endl;
    }
    return;
}

int main() {
    fast;
    //cout << fixed << satprecision(10);
    ll test;
    test = 1;
    //cin >> test;
    for (ll id = 0; id < test; ++id) solve();
    return 0;
}

Compilation message (stderr)

treearray.cpp:50:16: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   50 | const ll INF = 1e18;
      |                ^~~~

• Subtask 1: 12 / 12
• Subtask 2: 18 / 18
• Subtask 3: 26 / 26
• Subtask 4: 0 / 44