제출 #672385

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
672385		vjudge1	Race (IOI11_race)	C++17	0 / 100	2 ms	4948 KiB

race

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;


const int N = 2e5 + 10;

bool vis[N];
int sz[N], k;
int ans = -1;
map<ll, int> mn;
vector<pair<int, ll>> G[N];

int dfsSZ(int node, int par = -1)
{
    sz[node] = 1;
    for(auto &[ch, w]: G[node])
    {
        if(ch == par || vis[node])
            continue;
        sz[node] += dfsSZ(ch, node);
    }
    return sz[node];
}

int getCentroid(int node, int par, int n)
{
    for(auto &[ch, w]: G[node])
    {
        if(ch == par || vis[ch])
            continue;

        if(sz[ch] * 2 > n)
            return getCentroid(ch, node, n);
    }
    return node;
}

void dfs(int node, int par = -1, ll dist = 0, int dep = 0)
{
    if(mn.find(k - dist) != mn.end())
        ans = (ans == -1 ? mn[k - dist] + dep : min(ans, mn[k - dist] + dep));

    if(mn.find(dist) != mn.end())
        mn[dist] = min(mn[dist], dep);
    else
        mn[dist] = dep;

    for(auto &[ch, w]: G[node])
    {
        if(ch == par || vis[ch])
            continue;
        dfs(ch, node, dist + w, dep + 1);
    }
}


void decompose(int node = 0)
{
    int centroid = getCentroid(node, -1, dfsSZ(node));

    mn.clear();
    dfs(centroid);
    vis[centroid] = true;

    for(auto &[ch, w]: G[centroid])
    {
        if(vis[ch])
            continue;
        decompose(ch);
    }
}

int best_path(int n, int K, int H[][2], int L[])
{
    k = K;
    for(int i = 0; i < n - 1; i++)
    {
        G[H[i][0]].emplace_back(H[i][1], L[i]);
        G[H[i][1]].emplace_back(H[i][0], L[i]);
    }
    decompose();
    return ans;
}
//
//int main()
//{
//    int n, K;
//    cin >> n >> K;
//    int H[n][2], L[n];
//    for(int i = 0; i < n - 1; i++)
//        cin >> H[i][0] >> H[i][1];
//    for(int i = 0; i < n - 1; i++)
//        cin >> L[i];
//
//    cout << best_path(n, K, H, L) << '\n';
//}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57