Submission #146677

#	Time	Username	Problem	Language	Result	Execution time	Memory
146677		karma	Race (IOI11_race)	C++14	9 / 100	385 ms	53496 KiB

race

#include <bits/stdc++.h>
#include "race.h"
#define Task     "test"
#define ll        long long
#define pb        emplace_back
#define mp        make_pair
#define fi        first
#define se        second

using namespace std;

typedef pair<ll, ll> pii;
const int N = int(2e5) + 7;

set<pii>* s[N];
int n, k, u, v, w, res, sz[N], h[N], p[N];
ll d[N];
vector<pii> a[N];

void Build(int u)
{
    sz[u] = 1;
    for(pii adj: a[u]) {
        int v = adj.fi;
        if(v == p[u]) continue;
        p[v] = u, d[v] = d[u] + adj.se;
        h[v] = h[u] + 1, Build(v);
        sz[u] += sz[v];
    }
}

void Insert(int root, ll d, int _h)
{
     pii found = *(s[root] -> lower_bound(mp(d, h[root])));
     if(found.fi == d && found.se <= _h) return;
     if(found.fi == d) s[root] -> erase(found);
     s[root] -> insert(mp(d, _h));
}

void query(int u, int root)
{
    if(h[u] - h[root] >= res) return;
    ll dis = 2ll * d[root] + k - d[u];
    pii found = *(s[root] -> lower_bound(mp(dis, h[root])));
    if(found.fi == dis && found.se + h[u] - 2 * h[root] < res) res = found.se + h[u] - 2 * h[root];
    for(pii adj: a[u])
        if(adj.fi != p[u]) query(adj.fi, root);
}

void add(int u, int root)
{
    if(h[u] - h[root] >= res) return;
    Insert(root, d[u], h[u]);
    for(pii adj: a[u])
        if(adj.fi != p[u]) add(adj.fi, root);
}

void DSU(int u)
{
     int bigC = -1;
     for(pii adj: a[u]) {
        if(adj.fi == p[u]) continue;
        if(bigC == -1 || sz[adj.fi] > sz[bigC]) bigC = adj.fi;
     }
     for(pii adj: a[u]) {
        if(bigC == adj.fi || adj.fi == p[u]) continue;
        DSU(adj.fi);
     }
     if(bigC != -1) DSU(bigC), s[u] = s[bigC];
     else s[u] = new set<pii>();
     pii found = *(s[u] -> lower_bound(mp(d[u] + k, h[u])));
     if(found.fi == d[u] + k) res = min((ll)res, found.se - h[u]);
     Insert(u, d[u], h[u]);
     for(pii adj: a[u]) {
        if(bigC == adj.fi || adj.fi == p[u]) continue;
        query(adj.fi, u);
        add(adj.fi, u);
     }
}

int best_path(int _n, int _k, int _h[][2], int _l[])
{
    n = _n, k = _k;
    for(int i = 0, lim = n - 1; i < lim; ++i) {
       if(_l[i] < _k) a[_h[i][0]].pb(_h[i][1], _l[i]), a[_h[i][1]].pb(_h[i][0], _l[i]);
       else if(_l[i] == k) return 1;
    }
    res = n + 1; d[0] = h[0] = p[0] = 0;
    Build(0), DSU(0);
    if(res == n + 1) return -1;
    return res;
}

/*int _h[N][2], _n, _k, _l[N];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }

    cin >> _n >> _k;
    for(int i = 0; i < _n - 1; ++i) {
        cin >> _h[i][0] >> _h[i][1] >> _l[i];
    }
    cout << best_path(_n, _k, _h, _l);

    return 0;
}*/

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