oj.uz

Submission #998167

# Submission time Handle Problem Language Result Execution time Memory
998167 2024-06-13T11:12:21 Z The_Samurai Race (IOI11_race) C++17
21 / 100
 3000 ms 36512 KB 
#include "bits/stdc++.h"
#include "race.h"
using namespace std;
using ll = int;
const int inf = 1e9, N = 2e5 + 5;
int ans = inf, k;

vector<vector<pair<int, int>>> g(N);
vector<int> par(N, -1), heavy(N), height2(N);
vector<ll> height(N);
vector<set<pair<ll, int>>> st(N);

/*
height[heavy[u]] - height[v] = k + 


height[v] - height[u] = k?????


height[heavy[u]] - k - height[u] = height[v]
*/

int dfs(int u) {
    heavy[u] = u;
    int size = 1, max_child_size = 0;
    for (auto [v, w]: g[u]) {
        if (par[u] == v) continue;
        height[v] = height[u] + w;
        height2[v] = height2[u] + 1;
        par[v] = u;
        int child_size = dfs(v);
        if (child_size > max_child_size) {
            heavy[u] = heavy[v];
            max_child_size = child_size;
        }
        size += child_size;
    }
    return size;
}

void dfs2(int u) {
    for (auto [v, w]: g[u]) {
        if (par[u] == v) continue;
        dfs2(v);
    }
    multiset<pair<ll, int>> shit;
    for (auto it: st[heavy[u]]) shit.insert(it);
    // cout << u << ' ' << heavy[u] << endl;
    for (auto [v, w]: g[u]) {
        if (par[u] == v or heavy[u] == heavy[v]) continue;
        for (auto it: st[heavy[v]]) {
            st[heavy[u]].insert(it);
            shit.insert(it);
        }
    }
    // if (u == 1) {
    //     for (auto it: shit) {
    //         cout << it.first << ' ' << it.second << endl;
    //     }
    // }
    for (auto [v, w]: g[u]) {
        if (par[u] == v or heavy[u] == heavy[v]) continue;
        for (auto it: st[heavy[v]]) {
            shit.erase(shit.find(it));
        }
        for (auto it: st[heavy[v]]) {
            ll need = k - (it.first - height[u]) + height[u];
            auto it2 = shit.lower_bound(make_pair(need, 0));
            if (it2 != shit.end() and it2->first == need) {
                ans = min(ans, it2->second + it.second - 2 * height2[u]);
            }
        }
        for (auto it: st[heavy[v]]) {
            shit.insert(it);
        }
        st[heavy[v]].clear();
    }

    st[heavy[u]].emplace(height[u], height2[u]);
    ll search = k + height[u];
    auto it = st[heavy[u]].lower_bound(make_pair(search, 0));
    if (it != st[heavy[u]].end() and it->first == search) {
        ans = min(ans, it->second - height2[u]);
    }
}

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]);
    }
    // change it
    dfs(0);
    dfs2(0);
    return ans == inf ? -1 : ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19548 KB Output is correct
2 Correct 5 ms 19548 KB Output is correct
3 Correct 6 ms 19548 KB Output is correct
4 Correct 5 ms 19548 KB Output is correct
5 Correct 5 ms 19548 KB Output is correct
6 Correct 5 ms 19676 KB Output is correct
7 Correct 4 ms 19548 KB Output is correct
8 Correct 5 ms 19548 KB Output is correct
9 Correct 6 ms 19548 KB Output is correct
10 Correct 5 ms 19736 KB Output is correct
11 Correct 5 ms 19548 KB Output is correct
12 Correct 5 ms 19548 KB Output is correct
13 Correct 4 ms 19548 KB Output is correct
14 Correct 5 ms 19768 KB Output is correct
15 Correct 5 ms 19548 KB Output is correct
16 Correct 4 ms 19744 KB Output is correct
17 Correct 5 ms 19664 KB Output is correct
18 Correct 5 ms 19548 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19548 KB Output is correct
2 Correct 5 ms 19548 KB Output is correct
3 Correct 6 ms 19548 KB Output is correct
4 Correct 5 ms 19548 KB Output is correct
5 Correct 5 ms 19548 KB Output is correct
6 Correct 5 ms 19676 KB Output is correct
7 Correct 4 ms 19548 KB Output is correct
8 Correct 5 ms 19548 KB Output is correct
9 Correct 6 ms 19548 KB Output is correct
10 Correct 5 ms 19736 KB Output is correct
11 Correct 5 ms 19548 KB Output is correct
12 Correct 5 ms 19548 KB Output is correct
13 Correct 4 ms 19548 KB Output is correct
14 Correct 5 ms 19768 KB Output is correct
15 Correct 5 ms 19548 KB Output is correct
16 Correct 4 ms 19744 KB Output is correct
17 Correct 5 ms 19664 KB Output is correct
18 Correct 5 ms 19548 KB Output is correct
19 Correct 5 ms 19548 KB Output is correct
20 Correct 5 ms 19500 KB Output is correct
21 Correct 8 ms 19804 KB Output is correct
22 Correct 7 ms 19804 KB Output is correct
23 Correct 7 ms 19832 KB Output is correct
24 Correct 6 ms 19784 KB Output is correct
25 Correct 8 ms 19804 KB Output is correct
26 Correct 6 ms 19804 KB Output is correct
27 Correct 6 ms 19548 KB Output is correct
28 Correct 6 ms 19804 KB Output is correct
29 Correct 7 ms 19804 KB Output is correct
30 Correct 6 ms 19800 KB Output is correct
31 Correct 6 ms 19800 KB Output is correct
32 Correct 6 ms 19804 KB Output is correct
33 Correct 8 ms 19804 KB Output is correct
34 Correct 14 ms 20060 KB Output is correct
35 Correct 14 ms 19800 KB Output is correct
36 Correct 15 ms 19804 KB Output is correct
37 Correct 9 ms 19800 KB Output is correct
38 Correct 9 ms 19800 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19548 KB Output is correct
2 Correct 5 ms 19548 KB Output is correct
3 Correct 6 ms 19548 KB Output is correct
4 Correct 5 ms 19548 KB Output is correct
5 Correct 5 ms 19548 KB Output is correct
6 Correct 5 ms 19676 KB Output is correct
7 Correct 4 ms 19548 KB Output is correct
8 Correct 5 ms 19548 KB Output is correct
9 Correct 6 ms 19548 KB Output is correct
10 Correct 5 ms 19736 KB Output is correct
11 Correct 5 ms 19548 KB Output is correct
12 Correct 5 ms 19548 KB Output is correct
13 Correct 4 ms 19548 KB Output is correct
14 Correct 5 ms 19768 KB Output is correct
15 Correct 5 ms 19548 KB Output is correct
16 Correct 4 ms 19744 KB Output is correct
17 Correct 5 ms 19664 KB Output is correct
18 Correct 5 ms 19548 KB Output is correct
19 Correct 201 ms 25940 KB Output is correct
20 Correct 208 ms 26200 KB Output is correct
21 Correct 170 ms 25936 KB Output is correct
22 Correct 149 ms 26232 KB Output is correct
23 Correct 244 ms 26448 KB Output is correct
24 Correct 145 ms 25980 KB Output is correct
25 Execution timed out 3059 ms 36512 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19548 KB Output is correct
2 Correct 5 ms 19548 KB Output is correct
3 Correct 6 ms 19548 KB Output is correct
4 Correct 5 ms 19548 KB Output is correct
5 Correct 5 ms 19548 KB Output is correct
6 Correct 5 ms 19676 KB Output is correct
7 Correct 4 ms 19548 KB Output is correct
8 Correct 5 ms 19548 KB Output is correct
9 Correct 6 ms 19548 KB Output is correct
10 Correct 5 ms 19736 KB Output is correct
11 Correct 5 ms 19548 KB Output is correct
12 Correct 5 ms 19548 KB Output is correct
13 Correct 4 ms 19548 KB Output is correct
14 Correct 5 ms 19768 KB Output is correct
15 Correct 5 ms 19548 KB Output is correct
16 Correct 4 ms 19744 KB Output is correct
17 Correct 5 ms 19664 KB Output is correct
18 Correct 5 ms 19548 KB Output is correct
19 Correct 5 ms 19548 KB Output is correct
20 Correct 5 ms 19500 KB Output is correct
21 Correct 8 ms 19804 KB Output is correct
22 Correct 7 ms 19804 KB Output is correct
23 Correct 7 ms 19832 KB Output is correct
24 Correct 6 ms 19784 KB Output is correct
25 Correct 8 ms 19804 KB Output is correct
26 Correct 6 ms 19804 KB Output is correct
27 Correct 6 ms 19548 KB Output is correct
28 Correct 6 ms 19804 KB Output is correct
29 Correct 7 ms 19804 KB Output is correct
30 Correct 6 ms 19800 KB Output is correct
31 Correct 6 ms 19800 KB Output is correct
32 Correct 6 ms 19804 KB Output is correct
33 Correct 8 ms 19804 KB Output is correct
34 Correct 14 ms 20060 KB Output is correct
35 Correct 14 ms 19800 KB Output is correct
36 Correct 15 ms 19804 KB Output is correct
37 Correct 9 ms 19800 KB Output is correct
38 Correct 9 ms 19800 KB Output is correct
39 Correct 201 ms 25940 KB Output is correct
40 Correct 208 ms 26200 KB Output is correct
41 Correct 170 ms 25936 KB Output is correct
42 Correct 149 ms 26232 KB Output is correct
43 Correct 244 ms 26448 KB Output is correct
44 Correct 145 ms 25980 KB Output is correct
45 Execution timed out 3059 ms 36512 KB Time limit exceeded
46 Halted 0 ms 0 KB -