oj.uz

Submission #998180

# Submission time Handle Problem Language Result Execution time Memory
998180 2024-06-13T11:32:53 Z The_Samurai Race (IOI11_race) C++17
21 / 100
 3000 ms 68216 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;

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);
    }
    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 5 ms 20316 KB Output is correct
2 Correct 5 ms 20316 KB Output is correct
3 Correct 4 ms 20316 KB Output is correct
4 Correct 5 ms 20336 KB Output is correct
5 Correct 4 ms 20316 KB Output is correct
6 Correct 5 ms 20312 KB Output is correct
7 Correct 5 ms 20440 KB Output is correct
8 Correct 4 ms 20456 KB Output is correct
9 Correct 5 ms 20316 KB Output is correct
10 Correct 4 ms 20312 KB Output is correct
11 Correct 5 ms 20312 KB Output is correct
12 Correct 4 ms 20312 KB Output is correct
13 Correct 5 ms 20364 KB Output is correct
14 Correct 4 ms 20316 KB Output is correct
15 Correct 4 ms 20316 KB Output is correct
16 Correct 5 ms 20316 KB Output is correct
17 Correct 4 ms 20316 KB Output is correct
18 Correct 4 ms 20540 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 20316 KB Output is correct
2 Correct 5 ms 20316 KB Output is correct
3 Correct 4 ms 20316 KB Output is correct
4 Correct 5 ms 20336 KB Output is correct
5 Correct 4 ms 20316 KB Output is correct
6 Correct 5 ms 20312 KB Output is correct
7 Correct 5 ms 20440 KB Output is correct
8 Correct 4 ms 20456 KB Output is correct
9 Correct 5 ms 20316 KB Output is correct
10 Correct 4 ms 20312 KB Output is correct
11 Correct 5 ms 20312 KB Output is correct
12 Correct 4 ms 20312 KB Output is correct
13 Correct 5 ms 20364 KB Output is correct
14 Correct 4 ms 20316 KB Output is correct
15 Correct 4 ms 20316 KB Output is correct
16 Correct 5 ms 20316 KB Output is correct
17 Correct 4 ms 20316 KB Output is correct
18 Correct 4 ms 20540 KB Output is correct
19 Correct 4 ms 20288 KB Output is correct
20 Correct 6 ms 20316 KB Output is correct
21 Correct 5 ms 20572 KB Output is correct
22 Correct 5 ms 20636 KB Output is correct
23 Correct 6 ms 20572 KB Output is correct
24 Correct 6 ms 20572 KB Output is correct
25 Correct 6 ms 20572 KB Output is correct
26 Correct 5 ms 20572 KB Output is correct
27 Correct 5 ms 20316 KB Output is correct
28 Correct 5 ms 20444 KB Output is correct
29 Correct 6 ms 20824 KB Output is correct
30 Correct 6 ms 20612 KB Output is correct
31 Correct 5 ms 20388 KB Output is correct
32 Correct 5 ms 20572 KB Output is correct
33 Correct 6 ms 20572 KB Output is correct
34 Correct 7 ms 20572 KB Output is correct
35 Correct 6 ms 20572 KB Output is correct
36 Correct 6 ms 20548 KB Output is correct
37 Correct 6 ms 20572 KB Output is correct
38 Correct 5 ms 20572 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 20316 KB Output is correct
2 Correct 5 ms 20316 KB Output is correct
3 Correct 4 ms 20316 KB Output is correct
4 Correct 5 ms 20336 KB Output is correct
5 Correct 4 ms 20316 KB Output is correct
6 Correct 5 ms 20312 KB Output is correct
7 Correct 5 ms 20440 KB Output is correct
8 Correct 4 ms 20456 KB Output is correct
9 Correct 5 ms 20316 KB Output is correct
10 Correct 4 ms 20312 KB Output is correct
11 Correct 5 ms 20312 KB Output is correct
12 Correct 4 ms 20312 KB Output is correct
13 Correct 5 ms 20364 KB Output is correct
14 Correct 4 ms 20316 KB Output is correct
15 Correct 4 ms 20316 KB Output is correct
16 Correct 5 ms 20316 KB Output is correct
17 Correct 4 ms 20316 KB Output is correct
18 Correct 4 ms 20540 KB Output is correct
19 Correct 75 ms 26452 KB Output is correct
20 Correct 77 ms 26304 KB Output is correct
21 Correct 68 ms 26476 KB Output is correct
22 Correct 73 ms 26456 KB Output is correct
23 Correct 95 ms 26708 KB Output is correct
24 Correct 78 ms 26616 KB Output is correct
25 Correct 1273 ms 36552 KB Output is correct
26 Correct 76 ms 44624 KB Output is correct
27 Correct 204 ms 37800 KB Output is correct
28 Execution timed out 3071 ms 68216 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 20316 KB Output is correct
2 Correct 5 ms 20316 KB Output is correct
3 Correct 4 ms 20316 KB Output is correct
4 Correct 5 ms 20336 KB Output is correct
5 Correct 4 ms 20316 KB Output is correct
6 Correct 5 ms 20312 KB Output is correct
7 Correct 5 ms 20440 KB Output is correct
8 Correct 4 ms 20456 KB Output is correct
9 Correct 5 ms 20316 KB Output is correct
10 Correct 4 ms 20312 KB Output is correct
11 Correct 5 ms 20312 KB Output is correct
12 Correct 4 ms 20312 KB Output is correct
13 Correct 5 ms 20364 KB Output is correct
14 Correct 4 ms 20316 KB Output is correct
15 Correct 4 ms 20316 KB Output is correct
16 Correct 5 ms 20316 KB Output is correct
17 Correct 4 ms 20316 KB Output is correct
18 Correct 4 ms 20540 KB Output is correct
19 Correct 4 ms 20288 KB Output is correct
20 Correct 6 ms 20316 KB Output is correct
21 Correct 5 ms 20572 KB Output is correct
22 Correct 5 ms 20636 KB Output is correct
23 Correct 6 ms 20572 KB Output is correct
24 Correct 6 ms 20572 KB Output is correct
25 Correct 6 ms 20572 KB Output is correct
26 Correct 5 ms 20572 KB Output is correct
27 Correct 5 ms 20316 KB Output is correct
28 Correct 5 ms 20444 KB Output is correct
29 Correct 6 ms 20824 KB Output is correct
30 Correct 6 ms 20612 KB Output is correct
31 Correct 5 ms 20388 KB Output is correct
32 Correct 5 ms 20572 KB Output is correct
33 Correct 6 ms 20572 KB Output is correct
34 Correct 7 ms 20572 KB Output is correct
35 Correct 6 ms 20572 KB Output is correct
36 Correct 6 ms 20548 KB Output is correct
37 Correct 6 ms 20572 KB Output is correct
38 Correct 5 ms 20572 KB Output is correct
39 Correct 75 ms 26452 KB Output is correct
40 Correct 77 ms 26304 KB Output is correct
41 Correct 68 ms 26476 KB Output is correct
42 Correct 73 ms 26456 KB Output is correct
43 Correct 95 ms 26708 KB Output is correct
44 Correct 78 ms 26616 KB Output is correct
45 Correct 1273 ms 36552 KB Output is correct
46 Correct 76 ms 44624 KB Output is correct
47 Correct 204 ms 37800 KB Output is correct
48 Execution timed out 3071 ms 68216 KB Time limit exceeded
49 Halted 0 ms 0 KB -