제출 #1187639

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1187639		MatteoArcari	봉쇄 시간 (IOI23_closing)	C++20	0 / 100	1002 ms	2162688 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;

    vector<vector<ll>> dst(n, vector<ll>(n));
    for (int i = 0; i < n; i++) {
        ll sum = 0;
        for (int j = i + 1; j < n; j++) {
            dst[i][j] = dst[i][j - 1] + w[j - 1];
            dst[j][i] = dst[i][j];
        }
    }

    for (int i = 0; i < n; i++) {
        ll sum = 0;
        for (int j = i; j < n; j++) {
            sum += dst[j][x] + dst[j][y];
            if (sum > k) break;
            if (i <= x && j >= y) {
                ans = max(ans, 2 * (j - i + 1));
            }
        }
    }

    auto proc = [&w, &n, &dst](int x) -> vector<ll> {
        vector<ll> dp(n + 1, LLONG_MAX);
        dp[0] = 0;
        for (int i = 0; i < n; i++) {
            ll sum = 0;
            for (int j = i; j < n; j++) {
                sum += dst[x][j];
                if (i > x || j < x) continue;
                dp[j - i + 1] = min(dp[j - i + 1], sum);
            }
        }
        return dp;
    };

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

    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            if (dpX[i] + dpY[j] <= k) {
                ans = max(ans, i + j);
            }
        }
    }

    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