oj.uz

Submission #894005

# Submission time Handle Problem Language Result Execution time Memory
894005 2023-12-27T18:44:53 Z azosi Min-max tree (BOI18_minmaxtree) C++17
100 / 100
 258 ms 34804 KB 
#include <bits/stdc++.h>

#define x first
#define y second
using namespace std;
const int MAX_N = 70070;
const int INF = 1e9 + 100;
int n, q;

struct SegmentTree {
    typedef int (*F)(int, int);

    F merge;
    int identity;
    int tree[MAX_N * 4]{}, lazy[MAX_N * 4]{};

    SegmentTree(F func, int identity) : merge(func), identity(identity) {
        for (int i = 0; i < MAX_N * 4; ++i) tree[i] = lazy[i] = identity;
    }

    void push(int node, int l, int r) {
        if (lazy[node] != identity) {
            tree[node] = merge(tree[node], lazy[node]);
            if (l != r) {
                lazy[node * 2] = merge(lazy[node * 2], lazy[node]);
                lazy[node * 2 + 1] = merge(lazy[node * 2 + 1], lazy[node]);
            }
        }
        lazy[node] = identity;
    }

    void update(int s, int e, int val, int node = 1, int l = 1, int r = MAX_N) {
        push(node, l, r);
        if (e < l || r < s) return;
        if (s <= l && r <= e) {
            lazy[node] = val;
            push(node, l, r);
            return;
        }
        int mid = (l + r) / 2;
        update(s, e, val, node * 2, l, mid);
        update(s, e, val, node * 2 + 1, mid + 1, r);
        tree[node] = merge(tree[node * 2], tree[node * 2 + 1]);
    }

    int query(int s, int e, int node = 1, int l = 1, int r = MAX_N) {
        push(node, l, r);
        if (e < l || r < s) return identity;
        if (s <= l && r <= e) return tree[node];
        int mid = (l + r) / 2;
        return merge(query(s, e, node * 2, l, mid), query(s, e, node * 2 + 1, mid + 1, r));
    }

};

int _mn(int a, int b) {
    return min(a, b);
}

int _mx(int a, int b) {
    return max(a, b);
}

SegmentTree minSeg(_mn, INF), maxSeg(_mx, -INF);
int in[MAX_N], dep[MAX_N], par[MAX_N], top[MAX_N], sz[MAX_N], chk[MAX_N];
int pv;
vector<int> g[MAX_N], inp[MAX_N];

void dfs(int v = 1) {
    chk[v] = 1;
    for (auto i: inp[v]) {
        if (chk[i]) continue;
        chk[i] = 1;
        g[v].push_back(i);
        dfs(i);
    }
}

void dfs1(int v = 1) {
    sz[v] = 1;
    for (auto &i: g[v]) {
        dep[i] = dep[v] + 1;
        par[i] = v;
        dfs1(i);
        sz[v] += sz[i];
        if (sz[i] > sz[g[v][0]]) swap(i, g[v][0]);
    }
}

void dfs2(int v = 1) {
    in[v] = ++pv;
    for (auto i: g[v]) {
        top[i] = i == g[v][0] ? top[v] : i;
        dfs2(i);
    }
}

void update(int a, int b, int op, int k) {
    while (top[a] != top[b]) {
        if (dep[top[a]] < dep[top[b]]) swap(a, b);
        int st = top[a];
        if (op == 1) minSeg.update(in[st], in[a], k);
        else maxSeg.update(in[st], in[a], k);
        a = par[st];
    }
    if (dep[a] > dep[b]) swap(a, b);
    if (op == 1) minSeg.update(in[a] + 1, in[b], k);
    else maxSeg.update(in[a] + 1, in[b], k);
}

int mn[MAX_N], mx[MAX_N], cnt[MAX_N], ans[MAX_N], vis[MAX_N];
vector<int> bench[MAX_N];
struct Query {
    int s, e, x, mx;
};
vector<Query> qry;
map<int, int> mp;
vector<int> track[70707];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    top[1] = 1;
    for (int i = 2; i <= n; i++) {
        int s, e;
        cin >> s >> e;
        inp[s].push_back(e);
        inp[e].push_back(s);
    }
    dfs();
    dfs1();
    dfs2();

    cin >> q;

    for (int i = 0; i < q; i++) {
        char op;
        int a, b, c;
        cin >> op >> a >> b >> c;
        if (op == 'm') update(a, b, 2, c);
        else update(a, b, 1, c);
        qry.push_back({a, b, c, op == 'M'});
    }

    for (int i = 0; i < q; i++) mp[qry[i].x] = i;
    for (int i = 2; i <= n; i++) {
        mn[i] = maxSeg.query(in[i], in[i]);
        mx[i] = minSeg.query(in[i], in[i]);
        if (mn[i] != -INF) {
            cnt[mp[mn[i]]]++;
            track[mp[mn[i]]].push_back(i);
        }
        if (mx[i] != INF) {
            cnt[mp[mx[i]]]++;
            track[mp[mx[i]]].push_back(i);
        }
    }

    memset(chk, 0, sizeof chk);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    for (int i = 0; i < q; i++) pq.push({cnt[mp[qry[i].x]], i});
    while (!pq.empty()) {
        pair<int, int> now = pq.top();
        pq.pop();
        if (now.x != cnt[now.y]) continue;
        vis[now.y] = true;
        for (int i: track[now.y]) {
            if (chk[i]) continue;
            ans[i] = qry[now.y].x;
            chk[i] = true;
            if (qry[now.y].mx) {
                if (mn[i] != -INF) {
                    cnt[mp[mn[i]]]--;
                    if (!vis[mp[mn[i]]]) pq.push({cnt[mp[mn[i]]], mp[mn[i]]});
                }
            } else {
                if (mx[i] != INF) {
                    cnt[mp[mx[i]]]--;
                    if (!vis[mp[mx[i]]]) pq.push({cnt[mp[mx[i]]], mp[mx[i]]});
                }
            }
            break;
        }
    }
    for (int i = 2; i <= n; i++) if (!chk[i]) ans[i] = mn[i];
    for (int i = 2; i <= n; i++) {
        cout << par[i] << " " << i << " " << ans[i] << "\n";
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 4 ms 14428 KB Output is correct
3 Correct 3 ms 14468 KB Output is correct
4 Correct 3 ms 14428 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 30960 KB Output is correct
2 Correct 200 ms 26812 KB Output is correct
3 Correct 183 ms 28128 KB Output is correct
4 Correct 189 ms 32196 KB Output is correct
5 Correct 202 ms 27728 KB Output is correct
6 Correct 172 ms 28092 KB Output is correct
7 Correct 168 ms 27332 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 21484 KB Output is correct
2 Correct 109 ms 21712 KB Output is correct
3 Correct 108 ms 25548 KB Output is correct
4 Correct 96 ms 27084 KB Output is correct
5 Correct 113 ms 23244 KB Output is correct
6 Correct 130 ms 23584 KB Output is correct
7 Correct 120 ms 22536 KB Output is correct
8 Correct 117 ms 22348 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 4 ms 14428 KB Output is correct
3 Correct 3 ms 14468 KB Output is correct
4 Correct 3 ms 14428 KB Output is correct
5 Correct 197 ms 30960 KB Output is correct
6 Correct 200 ms 26812 KB Output is correct
7 Correct 183 ms 28128 KB Output is correct
8 Correct 189 ms 32196 KB Output is correct
9 Correct 202 ms 27728 KB Output is correct
10 Correct 172 ms 28092 KB Output is correct
11 Correct 168 ms 27332 KB Output is correct
12 Correct 127 ms 21484 KB Output is correct
13 Correct 109 ms 21712 KB Output is correct
14 Correct 108 ms 25548 KB Output is correct
15 Correct 96 ms 27084 KB Output is correct
16 Correct 113 ms 23244 KB Output is correct
17 Correct 130 ms 23584 KB Output is correct
18 Correct 120 ms 22536 KB Output is correct
19 Correct 117 ms 22348 KB Output is correct
20 Correct 238 ms 28456 KB Output is correct
21 Correct 210 ms 26316 KB Output is correct
22 Correct 204 ms 26228 KB Output is correct
23 Correct 204 ms 26148 KB Output is correct
24 Correct 238 ms 33220 KB Output is correct
25 Correct 242 ms 34804 KB Output is correct
26 Correct 216 ms 33144 KB Output is correct
27 Correct 247 ms 32644 KB Output is correct
28 Correct 218 ms 29632 KB Output is correct
29 Correct 225 ms 29632 KB Output is correct
30 Correct 216 ms 27452 KB Output is correct
31 Correct 220 ms 27592 KB Output is correct
32 Correct 222 ms 29128 KB Output is correct
33 Correct 258 ms 27452 KB Output is correct
34 Correct 230 ms 27456 KB Output is correct
35 Correct 236 ms 27080 KB Output is correct