Submission #42779

#	Time	Username	Problem	Language	Result	Execution time	Memory
42779		nickyrio	Birthday gift (IZhO18_treearray)	C++14	56 / 100	4064 ms	67464 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 201000
#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);

template<typename T> inline void read(T &x) {
    char c;
    bool neg = false;
    while (!isdigit(c = getchar()) && c != '-');
    x = 0;
    if (c == '-') {
        neg = true;
        c = getchar();
    }
    do {
        x = x * 10 + c - '0';
    } while (isdigit(c = getchar()));
    if (neg) x = -x;
}
template<typename T> inline void write(T x) {
    if (x < 0) {
        putchar('-');
        write(-x);return;
    }
    if (x < 10) {
        putchar(char(x + 48));
    }
    else {
        write(x/10);
        putchar(char(48 + x%10));
    }
}
template<typename T> inline void writeln(T x) {
    write(x);
    putchar('\n');
}
using namespace std;

int n, m, q, a[N], h[N];
int LCA[N][20], 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;
        FOR(j, 1, LOG) LCA[v][j] = LCA[LCA[v][j - 1]][j - 1];
        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
    read(n); read(m); read(q);
    LOG = log2(n);
    FOR(i, 2, n) {
        int u, v;
        read(u); read(v);
        e[u].push_back(v);
        e[v].push_back(u);
    }
    dfs(1, -1);
    FOR(i, 1, m) {
        read(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;
        read(type);
        if (type == 1) {
            read(l); read(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 {
            read(l); read(r); read(v); 
          	if (!One[v].empty() && *One[v].begin() <= r && *One[v].rbegin() >= l) {
                auto InOne = *lower_bound(One[v].begin(), One[v].end(), l);
            	if (InOne <= r) {
                    write(InOne); putchar(' '); writeln(InOne);
                    continue;
                }
            }
            if (!Two[v].empty() && *Two[v].begin() <= r && *Two[v].rbegin() > l) {
            	auto InTwo = *lower_bound(Two[v].begin(), Two[v].end(), l + 1);
                if (InTwo <= r) {
                    write(InTwo - 1); putchar(' '); writeln(InTwo);
                    continue;
                }
            }
            puts("-1 -1");
        }
    }
}

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