제출 #530308

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
530308		4fecta	Designated Cities (JOI19_designated_cities)	C++17	23 / 100	2073 ms	33884 KiB

designated_cities

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

struct edge {
    int u, f, b;
};

const int MN = 200005;

int n, q, u, v, w, x, cost, ans[MN], dp[MN], node[MN], pre[MN], up[MN], vis[MN];
vector<edge> a[MN];

void dfs1(int cur, int par) {
    for (auto nxt : a[cur]) {
        if (nxt.u == par) continue;
        cost += nxt.f;
        dfs1(nxt.u, cur);
    }
}

void dfs2(int cur, int par) {
    ans[1] = min(ans[1], cost);
    for (auto nxt : a[cur]) {
        if (nxt.u == par) continue;
        cost += nxt.b - nxt.f;
        dfs2(nxt.u, cur);
        cost += nxt.f - nxt.b;
    }
}

void dfs3(int cur, int par) {
    node[cur] = cur;
    for (auto nxt : a[cur]) {
        if (nxt.u == par) continue;
        cost += nxt.b - nxt.f;
        dfs3(nxt.u, cur);
        cost += nxt.f - nxt.b;
        int val = dp[cur] + dp[nxt.u] + nxt.f;
        if (cost - val < ans[2]) {
            ans[2] = cost - val;
            u = node[cur], v = node[nxt.u];
        }
        if (dp[cur] < dp[nxt.u] + nxt.f) {
            dp[cur] = dp[nxt.u] + nxt.f;
            node[cur] = node[nxt.u];
        }
    }
}

void dfs4(int cur, int par) {
    pre[cur] = par;
    for (auto nxt : a[cur]) {
        if (nxt.u == par) continue;
        up[nxt.u] = nxt.f;
        dfs4(nxt.u, cur);
    }
}

void solve1() {
    dfs1(1, 0);
    dfs2(1, 0);
}

void solve_other() {
    dfs3(1, 0);
    dfs4(u, 0);
    while (v != u) vis[v] = 1, v = pre[v];
    vis[v] = 1;
    for (int i = 3; i <= n; i++) {
        ans[i] = ans[i - 1];
        int best = 0;
        for (int j = 1; j <= n; j++) {
            if (vis[j] || a[j].size() > 1) continue;
            int tmp = 0;
            u = j;
            while (!vis[u]) tmp += up[u], u = pre[u];
            if (tmp > best) best = tmp, v = j;
        }
        ans[i] -= best;
        while (!vis[v]) vis[v] = 1, v = pre[v];
    }
}

int32_t main() {
    boost();

    memset(ans, 0x3f, sizeof(ans));
    cin >> n;
    for (int i = 1; i < n; i++) {
        cin >> u >> v >> w >> x;
        a[u].push_back({v, w, x});
        a[v].push_back({u, x, w});
    }
    solve1();
    solve_other();
    cin >> q;
    while (q--) {
        cin >> x;
        printf("%lld\n", ans[x]);
    }

    return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 9
• Subtask 4: 17 / 17
• Subtask 5: 0 / 17
• Subtask 6: 0 / 44