제출 #1056701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056701		perekopskad	봉쇄 시간 (IOI23_closing)	C++17	8 / 100	97 ms	36860 KiB

closing

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define el '\n'
#define ff first
#define ss second
#define pii pair <ll, ll>
#define pb push_back
#define mkp make_pair
#define fr(i, l, r) for(ll i = l; i <= r; i++)
#define debug(x) \
    { cout << #x << " = " << x << el; }

template<class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}

template<class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}

const ll N = 2e5 + 10;
const ll M = 1e5 + 10;
const ll K = 400;
const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll LOG = 20;
const ll mod = 1000002022;
mt19937 rnd(time(0));

/*
1
4 0 3 37
0 1 18
1 2 1
2 3 19
*/

vector <pii> g[N];
ll d[2][N];

void dfs(int v, int p, int t) {
    for(pii u : g[v]) {
        if(u.ff == p) continue;
        d[t][u.ff] = d[t][v] + u.ss;
        dfs(u.ff, v, t);
    }
}

int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    fr(i, 0, N - 1)
        g[i].clear();
    fr(i, 0, N - 2) {
        g[U[i]].pb({V[i], W[i]});
        g[V[i]].pb({U[i], W[i]});
    }
    d[0][X] = 0; d[1][Y] = 0;
    dfs(X, X, 0);
    dfs(Y, Y, 1);

    vector <ll> s;
    for(int i = 0; i < N; i++)
        s.pb(min(d[0][i], d[1][i]));
    sort(s.begin(), s.end());

    ll ans = 0;
    for(int i = 0; i < N; i++) {
        if(K >= s[i]) {
            K -= s[i];
            ans++;
        }
    }

    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 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