oj.uz

답안 #894007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894007 2023-12-27T18:57:44 Z azosi Min-max tree (BOI18_minmaxtree) C++17
100 / 100
 262 ms 31740 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 maxi[MAX_N], mini[MAX_N], cnt[MAX_N], ans[MAX_N], vis[MAX_N];

struct Query {
    int s, e, x, mx;
};
vector<Query> qry;
map<int, int> mp;
vector<int> bench[MAX_N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    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++) {
        maxi[i] = maxSeg.query(in[i], in[i]);
        mini[i] = minSeg.query(in[i], in[i]);
        if (maxi[i] != -INF) {
            bench[mp[maxi[i]]].push_back(i);
        }
        if (mini[i] != INF) {
            bench[mp[mini[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++) {
        cnt[mp[qry[i].x]] = bench[mp[qry[i].x]].size();
        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: bench[now.y]) {
            if (chk[i]) continue;
            ans[i] = qry[now.y].x;
            chk[i] = true;
            if (qry[now.y].mx) {
                if (maxi[i] != -INF) {
                    cnt[mp[maxi[i]]]--;
                    if (!vis[mp[maxi[i]]]) pq.push({cnt[mp[maxi[i]]], mp[maxi[i]]});
                }
            } else {
                if (mini[i] != INF) {
                    cnt[mp[mini[i]]]--;
                    if (!vis[mp[mini[i]]]) pq.push({cnt[mp[mini[i]]], mp[mini[i]]});
                }
            }
            break;
        }
    }
    for (int i = 2; i <= n; i++) if (!chk[i]) ans[i] = maxi[i];
    for (int i = 2; i <= n; i++) {
        cout << par[i] << " " << i << " " << ans[i] << "\n";
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 3 ms 12632 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 29412 KB Output is correct
2 Correct 207 ms 25136 KB Output is correct
3 Correct 183 ms 26560 KB Output is correct
4 Correct 183 ms 30660 KB Output is correct
5 Correct 185 ms 26048 KB Output is correct
6 Correct 188 ms 26264 KB Output is correct
7 Correct 179 ms 25632 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 19840 KB Output is correct
2 Correct 113 ms 19884 KB Output is correct
3 Correct 96 ms 24128 KB Output is correct
4 Correct 101 ms 25508 KB Output is correct
5 Correct 113 ms 21452 KB Output is correct
6 Correct 113 ms 21960 KB Output is correct
7 Correct 120 ms 20944 KB Output is correct
8 Correct 124 ms 20720 KB Output is correct

Subtask #4
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 3 ms 12632 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 183 ms 29412 KB Output is correct
6 Correct 207 ms 25136 KB Output is correct
7 Correct 183 ms 26560 KB Output is correct
8 Correct 183 ms 30660 KB Output is correct
9 Correct 185 ms 26048 KB Output is correct
10 Correct 188 ms 26264 KB Output is correct
11 Correct 179 ms 25632 KB Output is correct
12 Correct 106 ms 19840 KB Output is correct
13 Correct 113 ms 19884 KB Output is correct
14 Correct 96 ms 24128 KB Output is correct
15 Correct 101 ms 25508 KB Output is correct
16 Correct 113 ms 21452 KB Output is correct
17 Correct 113 ms 21960 KB Output is correct
18 Correct 120 ms 20944 KB Output is correct
19 Correct 124 ms 20720 KB Output is correct
20 Correct 262 ms 25128 KB Output is correct
21 Correct 218 ms 23260 KB Output is correct
22 Correct 203 ms 23372 KB Output is correct
23 Correct 208 ms 23496 KB Output is correct
24 Correct 250 ms 30152 KB Output is correct
25 Correct 227 ms 31740 KB Output is correct
26 Correct 213 ms 30200 KB Output is correct
27 Correct 260 ms 29424 KB Output is correct
28 Correct 226 ms 26304 KB Output is correct
29 Correct 228 ms 26332 KB Output is correct
30 Correct 208 ms 24452 KB Output is correct
31 Correct 220 ms 24520 KB Output is correct
32 Correct 230 ms 25844 KB Output is correct
33 Correct 235 ms 24612 KB Output is correct
34 Correct 236 ms 24568 KB Output is correct
35 Correct 212 ms 24260 KB Output is correct