제출 #1217909

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1217909		qwusha	봉쇄 시간 (IOI23_closing)	C++20	0 / 100	173 ms	28484 KiB

closing

#include <bits/stdc++.h>
#include "closing.h"
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
ll inf = 1e18;

ll n, x, y, k;
vector<vector<pair<ll,ll>>> g;
vector<ll> dist;
vector<bool> used;

void dfs(ll ve, ll d = 0) {
    dist[ve] = min(dist[ve], d);
    used[ve] = 1;
    if (dist[ve] < d) {
        return;
    }
    for (auto [uv, le] : g[ve]) {
        if (used[uv])
            continue;
        dfs(uv, d + le);
    }
}


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;
    g.resize(N);
    for (int i = 0; i < n - 1; i++) {
        g[V[i]].push_back({U[i], W[i]});
        g[U[i]].push_back({V[i], W[i]});
    }
    dist.assign(n, inf);
    used.assign(n, 0);
    dfs(x);
    used.assign(n, 0);
    dfs(y);
    sort(dist.begin(), dist.end());
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        if (dist[i] <= k) {
            cnt++;
            k -= dist[i];
        }
    }
    return cnt;
}

• 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