제출 #1070284

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1070284		zsombor	봉쇄 시간 (IOI23_closing)	C++17	43 / 100	64 ms	33444 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll n, x, y, k, ans;
vector<vector<pair<int, ll> > > g(3e5);
vector<vector<ll> > d(2, vector<ll>(3e5, -1));
vector<ll> c(3e5, 0);
vector<vector<bool> > b(2, vector<bool>(3e5, false));
priority_queue<pair<ll, int> > pq;

void reset() {
    for (int i = 0; i < n; i++) {
        g[i].clear();
        d[0][i] = d[1][i] = -1;
        c[i] = 0;
        b[0][i] = b[1][i] = false;
    }
    while (pq.size()) pq.pop();
    ans = 0;
}

int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    x = X;
    y = Y;
    k = K;
    reset();
    for (int i = 0; i < n - 1; i++) {
        g[U[i]].push_back({V[i], W[i]});
        g[V[i]].push_back({U[i], W[i]});
    }
    d[0][x] = d[1][y] = 0;
    pq.push({0, x});
    pq.push({0, y + n});
    while (pq.size()) {
        int i = pq.top().second, j = 0;
        pq.pop();
        if (i >= n) {
            i -= n;
            j++;
        }
        if (b[j][i]) continue;
        if (d[j][i] - c[i] > k) return ans;
        k -= d[j][i] - c[i];
        c[i] = d[j][i];
        b[j][i] = true;
        if (d[1 - j][i] > -1) pq.push({c[i] - d[1 - j][i], (1 - j ? i + n : i)});
        ans++;
        for (auto p: g[i]) {
            ll l = p.first, w = p.second;
            if (d[j][l] > -1) continue;
            d[j][l] = d[j][i] + w;
            int l2 = (j ? l + n : l);
            pq.push({c[l] - d[j][l], l2});
        }
    }
    return ans;
}

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