Submission #1187687

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187687		MatteoArcari	봉쇄 시간 (IOI23_closing)	C++20	0 / 100	105 ms	29336 KiB

closing

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;

int max_score(int n, int x, int y, ll k, vi u, vi v, vi w) {

    vector<vector<pair<int, ll>>> adj(n);

    for (int i = 0; i < n - 1; i++) {
        adj[u[i]].push_back({v[i], w[i]});
        adj[v[i]].push_back({u[i], w[i]});
    }
    
    int ans = 2;

    auto calc = [&adj, &n](int x) -> vector<ll> {
        vector<ll> dp(n + 1);
        vector<ll> dst;
        auto dfs = [&](auto &&dfs, int i, int p, ll d) -> void {
            dst.push_back(d);
            for (auto [j, w]: adj[i]) {
                if (j == p) continue;
                dfs(dfs, j, i, d + w);
            }
        }; dfs(dfs, x, -1, 0);
        sort(dst.rbegin(), dst.rend());
        for (int i = 1; i <= n; i++) {
            dp[i] = dp[i - 1] + dst.back();
            dst.pop_back();
        }
        return dp;
    };

    vector<ll> dpX = calc(x);
    vector<ll> dpY = calc(y);

    ans = -1;
    for (int sus = 1 << 18; sus; sus >>= 1) {
        int sum = ans + sus;
        if (sum > n) continue;
        for (int i = 0; i <= n; i++) {
            if (dpX[i] + dpY[sum - i] <= k) {
                ans = sum;
                break;
            }
        }
    }

    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17