Submission #1212442

#	Time	Username	Problem	Language	Result	Execution time	Memory
1212442		qilby	Cat Exercise (JOI23_ho_t4)	C++20	0 / 100	5 ms	9800 KiB

Main

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 200009;

vector < int > g[N], q[N];
ll n, h[N], w[N], f[N], s[N], lnk[N];

int get(int v) { return (v == lnk[v] ? v : lnk[v] = get(lnk[v])); }

void unite(int u, int v) {
    u = get(u), v = get(v);
    if (u == v) return;
    lnk[u] = v;
    s[v] = max(s[v], s[u]);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> h[i];
        w[h[i]] = i;
    }

    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    for (int i = 1; i <= n; i++) lnk[i] = i;

    for (int i = 1; i <= n; i++) {
        int v = w[i];
        for (auto u : g[v]) q[s[get(u)]].push_back(h[v]);
        s[v] = h[v];
        for (auto u : g[v]) unite(u, v);
    }

    for (int i = 1; i <= n; i++) {
        for (auto j : q[i]) f[j] = max(f[j], f[i] + abs(w[i] - w[j]));
    }

    cout << f[n];
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 7
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 23
• Subtask 7: 0 / 26