oj.uz

Submission #998186

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

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;

/*
*/

int dfs(int 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;
    }
    if (size == 1) {
        heavy[u] = z++;
        st.emplace_back();
    }
    return size;
}

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

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 3 ms 11100 KB Output is correct
2 Correct 3 ms 11100 KB Output is correct
3 Correct 3 ms 11128 KB Output is correct
4 Correct 3 ms 11100 KB Output is correct
5 Correct 3 ms 11100 KB Output is correct
6 Correct 4 ms 11100 KB Output is correct
7 Correct 3 ms 11096 KB Output is correct
8 Correct 4 ms 11100 KB Output is correct
9 Correct 3 ms 11028 KB Output is correct
10 Correct 3 ms 11100 KB Output is correct
11 Correct 3 ms 11068 KB Output is correct
12 Correct 2 ms 11100 KB Output is correct
13 Correct 3 ms 11100 KB Output is correct
14 Correct 3 ms 11100 KB Output is correct
15 Correct 3 ms 11100 KB Output is correct
16 Correct 3 ms 11100 KB Output is correct
17 Correct 3 ms 11100 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11100 KB Output is correct
2 Correct 3 ms 11100 KB Output is correct
3 Correct 3 ms 11128 KB Output is correct
4 Correct 3 ms 11100 KB Output is correct
5 Correct 3 ms 11100 KB Output is correct
6 Correct 4 ms 11100 KB Output is correct
7 Correct 3 ms 11096 KB Output is correct
8 Correct 4 ms 11100 KB Output is correct
9 Correct 3 ms 11028 KB Output is correct
10 Correct 3 ms 11100 KB Output is correct
11 Correct 3 ms 11068 KB Output is correct
12 Correct 2 ms 11100 KB Output is correct
13 Correct 3 ms 11100 KB Output is correct
14 Correct 3 ms 11100 KB Output is correct
15 Correct 3 ms 11100 KB Output is correct
16 Correct 3 ms 11100 KB Output is correct
17 Correct 3 ms 11100 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 3 ms 11100 KB Output is correct
20 Correct 3 ms 11100 KB Output is correct
21 Correct 4 ms 11100 KB Output is correct
22 Correct 4 ms 11100 KB Output is correct
23 Correct 3 ms 11100 KB Output is correct
24 Correct 4 ms 11100 KB Output is correct
25 Correct 3 ms 11100 KB Output is correct
26 Correct 3 ms 11100 KB Output is correct
27 Correct 3 ms 11100 KB Output is correct
28 Correct 6 ms 11100 KB Output is correct
29 Correct 4 ms 11100 KB Output is correct
30 Correct 3 ms 11100 KB Output is correct
31 Correct 4 ms 11100 KB Output is correct
32 Correct 4 ms 11100 KB Output is correct
33 Correct 4 ms 11100 KB Output is correct
34 Correct 4 ms 11100 KB Output is correct
35 Correct 5 ms 11100 KB Output is correct
36 Correct 4 ms 11100 KB Output is correct
37 Correct 4 ms 11100 KB Output is correct
38 Correct 3 ms 11056 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11100 KB Output is correct
2 Correct 3 ms 11100 KB Output is correct
3 Correct 3 ms 11128 KB Output is correct
4 Correct 3 ms 11100 KB Output is correct
5 Correct 3 ms 11100 KB Output is correct
6 Correct 4 ms 11100 KB Output is correct
7 Correct 3 ms 11096 KB Output is correct
8 Correct 4 ms 11100 KB Output is correct
9 Correct 3 ms 11028 KB Output is correct
10 Correct 3 ms 11100 KB Output is correct
11 Correct 3 ms 11068 KB Output is correct
12 Correct 2 ms 11100 KB Output is correct
13 Correct 3 ms 11100 KB Output is correct
14 Correct 3 ms 11100 KB Output is correct
15 Correct 3 ms 11100 KB Output is correct
16 Correct 3 ms 11100 KB Output is correct
17 Correct 3 ms 11100 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 72 ms 20168 KB Output is correct
20 Correct 71 ms 20164 KB Output is correct
21 Correct 74 ms 21188 KB Output is correct
22 Correct 77 ms 20964 KB Output is correct
23 Correct 90 ms 21708 KB Output is correct
24 Correct 69 ms 24776 KB Output is correct
25 Correct 1342 ms 27188 KB Output is correct
26 Correct 79 ms 35240 KB Output is correct
27 Correct 196 ms 33920 KB Output is correct
28 Execution timed out 3071 ms 58356 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11100 KB Output is correct
2 Correct 3 ms 11100 KB Output is correct
3 Correct 3 ms 11128 KB Output is correct
4 Correct 3 ms 11100 KB Output is correct
5 Correct 3 ms 11100 KB Output is correct
6 Correct 4 ms 11100 KB Output is correct
7 Correct 3 ms 11096 KB Output is correct
8 Correct 4 ms 11100 KB Output is correct
9 Correct 3 ms 11028 KB Output is correct
10 Correct 3 ms 11100 KB Output is correct
11 Correct 3 ms 11068 KB Output is correct
12 Correct 2 ms 11100 KB Output is correct
13 Correct 3 ms 11100 KB Output is correct
14 Correct 3 ms 11100 KB Output is correct
15 Correct 3 ms 11100 KB Output is correct
16 Correct 3 ms 11100 KB Output is correct
17 Correct 3 ms 11100 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 3 ms 11100 KB Output is correct
20 Correct 3 ms 11100 KB Output is correct
21 Correct 4 ms 11100 KB Output is correct
22 Correct 4 ms 11100 KB Output is correct
23 Correct 3 ms 11100 KB Output is correct
24 Correct 4 ms 11100 KB Output is correct
25 Correct 3 ms 11100 KB Output is correct
26 Correct 3 ms 11100 KB Output is correct
27 Correct 3 ms 11100 KB Output is correct
28 Correct 6 ms 11100 KB Output is correct
29 Correct 4 ms 11100 KB Output is correct
30 Correct 3 ms 11100 KB Output is correct
31 Correct 4 ms 11100 KB Output is correct
32 Correct 4 ms 11100 KB Output is correct
33 Correct 4 ms 11100 KB Output is correct
34 Correct 4 ms 11100 KB Output is correct
35 Correct 5 ms 11100 KB Output is correct
36 Correct 4 ms 11100 KB Output is correct
37 Correct 4 ms 11100 KB Output is correct
38 Correct 3 ms 11056 KB Output is correct
39 Correct 72 ms 20168 KB Output is correct
40 Correct 71 ms 20164 KB Output is correct
41 Correct 74 ms 21188 KB Output is correct
42 Correct 77 ms 20964 KB Output is correct
43 Correct 90 ms 21708 KB Output is correct
44 Correct 69 ms 24776 KB Output is correct
45 Correct 1342 ms 27188 KB Output is correct
46 Correct 79 ms 35240 KB Output is correct
47 Correct 196 ms 33920 KB Output is correct
48 Execution timed out 3071 ms 58356 KB Time limit exceeded
49 Halted 0 ms 0 KB -