Submission #42793

#	Time	Username	Problem	Language	Result	Execution time	Memory
42793		nickyrio	Birthday gift (IZhO18_treearray)	C++14	100 / 100	1377 ms	75368 KiB

treearray

#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i<= b; ++i)
#define FORD(i, a, b) for (int i = a; i>=b; --i)
#define REP(i, a) for (int i = 0; i<a; ++i)
#define DEBUG(x) { cerr << #x << " = " << x << endl; }
#define Arr(A, l, r) { cerr << #A  << " = "; FOR(_, l, r) cerr << A[_] << ' '; cerr << endl; }
#define N 200002
#define pp pair<int, int>
#define next __next
#define prev __prev
#define __builtin_popcount __builtin_popcountll
#define bit(S, i) (((S) >> i) & 1)
#define IO ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
using namespace std;
 
int n, m, q, a[N], h[N];
int LCA[N][18], LOG;
vector<int> e[N];
set<int> One[N], Two[N];
 
void dfs(int u, int p) {
    for (int v : e[u]) if (v != p) {
        h[v] = h[u] + 1;
        LCA[v][0] = u;
        dfs(v, u);
    }
}
 
int lca(int u, int v) {
    if (h[u] < h[v]) swap(u, v);
    int delta = h[u] - h[v];
    FORD(i, LOG, 0) if (bit(delta, i)) u = LCA[u][i];
    if (u == v) return u;
    FORD(i, LOG, 0) if (LCA[u][i] != LCA[v][i]) {
        u = LCA[u][i]; v = LCA[v][i];
    }
    return LCA[u][0];
}
int main() {
    #ifdef NERO
    freopen("test.inp","r",stdin);
    freopen("test.out","w",stdout);
    #endif //NERO
    IO;
    cin >> n >> m >> q;
    LOG = log2(n);
    FOR(i, 2, n) {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    dfs(1, -1);
    FOR(j, 1, LOG) FOR(v, 1, n) LCA[v][j] = LCA[LCA[v][j - 1]][j - 1];
    FOR(i, 1, m) {
        cin >> a[i];
        One[a[i]].insert(i);
        if (i != 1) {
            Two[lca(a[i], a[i - 1])].insert(i);
        }
    }
    while (q--) {
        int type, v, l, r;
        cin >> type;
        if (type == 1) {
            cin >> l >> v;
            One[a[l]].erase(l);
            if (l > 1) Two[lca(a[l - 1], a[l])].erase(l);
            if (l < m) Two[lca(a[l], a[l + 1])].erase(l + 1);
            a[l] = v;
            One[a[l]].insert(l);
            if (l > 1) Two[lca(a[l], a[l - 1])].insert(l);
            if (l < m) Two[lca(a[l], a[l + 1])].insert(l + 1);
        }
        else {
            cin >> l >> r >> v;
            set<int> :: iterator InOne, InTwo;
            InOne = One[v].lower_bound(l);
            InTwo = Two[v].lower_bound(l + 1);
          	int x = -1, y = -1;
            if (InOne != One[v].end() && (*InOne) <= r) x = (*InOne), y = x;
            if (InTwo != Two[v].end() && (*InTwo) <= r) x = (*InTwo) - 1, y = x + 1;
            printf("%d %d\n", x, y);
        }
    }
}

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