제출 #1215608

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

vector<vector<pair<ll, ll>>> g;

vector<ll> dist;
vector<ll> v, u, w;

void dfs(ll x, ll d=0, ll p= -1) {
    dist[x] = d;
    for (auto [y, ti] : g[x]) {
        if (p != y) {
            dfs(y, d + ti, x);
        }
    }
}



int max_score(int n, int x, int y, ll k, vector<int> U, vector<int> V, vector<int> W) {
    g.resize(n);
    v.resize(n - 1);
    u.resize(n - 1);
    w.resize(n - 1);
    for (ll i = 0; i < n - 1; i++) {
        v[i] = V[i];
        u[i] = U[i];
        w[i] = W[i];
        g[u[i]].push_back({v[i], w[i]});
        g[v[i]].push_back({u[i], w[i]});
    }
    dist.assign(n, inf);
    dfs(x);
    dfs(y);
    sort(dist.begin(), dist.end());
    int cnt = 0;
    for (ll i = 0; i < n; i++) {
        if (k >= dist[i]) {
            k -= dist[i];
            cnt++;
        } else {
            break;
        }
    }
    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