oj.uz

Submission #94227

# Submission time Handle Problem Language Result Execution time Memory
94227 2019-01-16T22:43:35 Z arknave Race (IOI11_race) C++14
43 / 100
 1432 ms 55716 KB 
#include "race.h"
#include <bits/stdc++.h>

#define all(x) begin(x), end(x)

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

void dfs_sz(const vector<vector<pii>>& tree, vi& vis, vi& size, int u, int p = -1) {
    size[u] = 1;
    for (auto& e : tree[u]) {
        int v = e.first;
        if (v == p or vis[v])
            continue;
        dfs_sz(tree, vis, size, v, u);
        size[u] += size[v];
    }
}

int find_center(const vector<vector<pii>>& tree, vi& vis, vi& size, int tot, int u, int p = -1) {
    for (auto& e : tree[u]) {
        int v = e.first;
        if (v == p or vis[v]) 
            continue;
        if (2 * size[v] >= tot)
            return find_center(tree, vis, size, tot, v, u);
    }

    return u;
}

template <typename F>
void centroid(F& f, const vector<vector<pii>>& tree, vi& vis, vi& size, int u, int p = -1) {
    dfs_sz(tree, vis, size, u, p);
    int c = find_center(tree, vis, size, size[u], u, p);
    // do some shit here
    f(c);

    vis[c] = true;
    for (auto& e : tree[c]) {
        int v = e.first;
        if (v != p and !vis[v]) {
            centroid(f, tree, vis, size, v, c);
        }
    }
}

void dfs_path(const vector<vector<pii>>& tree, const vi& vis, int u, int p, ll path_len, int edges, map<ll, int>& m) {
    auto it = m.find(path_len);
    if (it == end(m) or it->second > edges) {
        m[path_len] = edges;
    }

    for (auto& e : tree[u]) {
        int v, w;
        tie(v, w) = e;
        if (vis[v] or v == p)
            continue;
        dfs_path(tree, vis, v, u, path_len + w, edges + 1, m);
    }
}

int solve(const vector<vector<pii>>& tree, int k) {
    int n = tree.size();
    vi vis(n, 0);

    constexpr int INF = 1e9 + 7;
    int ans = INF;
    auto f = [&](int u) {
        // one more dfs
        // path length -> shortest leg with that length
        // add then merge maps
        map<ll, int> left, right;
        left[0] = 0;
        for (auto& e : tree[u]) {
            int v, w;
            tie(v, w) = e;
            if (vis[v]) {
                continue;
            }

            right.clear();
            // cout << "Starting path at node " << v << " weight " << w << '\n';
            dfs_path(tree, vis, v, u, w, 1, right);

            for (auto& p : right) {
                // cout << "Considering w " << p.first << " e " << p.second << '\n';
                ll path_len = p.first;
                int edges = p.second;
                auto it = left.find(k - path_len);
                if (it != end(left)) {
                    ans = min(ans, edges + it->second);
                }
            }

            left.insert(all(right));
        }
    };

    vi size(n, 0);
    centroid(f, tree, vis, size, 0, -1);

    return ans == INF ? -1 : ans;
}

int best_path(int n, int k, int h[][2], int l[]) {
    // create the tree
    vector<vector<pii>> tree(n);
    for (int i = 0; i < n - 1; ++i) {
        int u = h[i][0];
        int v = h[i][1];
        int w = l[i];

        tree[u].emplace_back(v, w);
        tree[v].emplace_back(u, w);
    }

    return solve(tree, k);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 420 KB Output is correct
21 Correct 3 ms 368 KB Output is correct
22 Correct 4 ms 480 KB Output is correct
23 Correct 4 ms 504 KB Output is correct
24 Correct 4 ms 504 KB Output is correct
25 Correct 4 ms 532 KB Output is correct
26 Correct 4 ms 424 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 4 ms 504 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 4 ms 504 KB Output is correct
32 Correct 4 ms 504 KB Output is correct
33 Correct 4 ms 536 KB Output is correct
34 Correct 4 ms 504 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 4 ms 548 KB Output is correct
37 Correct 3 ms 508 KB Output is correct
38 Correct 3 ms 504 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 253 ms 9736 KB Output is correct
20 Correct 239 ms 9824 KB Output is correct
21 Correct 231 ms 9720 KB Output is correct
22 Correct 198 ms 9724 KB Output is correct
23 Correct 333 ms 10104 KB Output is correct
24 Correct 157 ms 9976 KB Output is correct
25 Correct 201 ms 14812 KB Output is correct
26 Correct 97 ms 18552 KB Output is correct
27 Correct 332 ms 19576 KB Output is correct
28 Correct 1287 ms 55716 KB Output is correct
29 Correct 1323 ms 54348 KB Output is correct
30 Correct 410 ms 19704 KB Output is correct
31 Correct 368 ms 19832 KB Output is correct
32 Correct 491 ms 19832 KB Output is correct
33 Correct 729 ms 18692 KB Output is correct
34 Correct 1432 ms 34936 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 420 KB Output is correct
21 Correct 3 ms 368 KB Output is correct
22 Correct 4 ms 480 KB Output is correct
23 Correct 4 ms 504 KB Output is correct
24 Correct 4 ms 504 KB Output is correct
25 Correct 4 ms 532 KB Output is correct
26 Correct 4 ms 424 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 4 ms 504 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 4 ms 504 KB Output is correct
32 Correct 4 ms 504 KB Output is correct
33 Correct 4 ms 536 KB Output is correct
34 Correct 4 ms 504 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 4 ms 548 KB Output is correct
37 Correct 3 ms 508 KB Output is correct
38 Correct 3 ms 504 KB Output is correct
39 Correct 253 ms 9736 KB Output is correct
40 Correct 239 ms 9824 KB Output is correct
41 Correct 231 ms 9720 KB Output is correct
42 Correct 198 ms 9724 KB Output is correct
43 Correct 333 ms 10104 KB Output is correct
44 Correct 157 ms 9976 KB Output is correct
45 Correct 201 ms 14812 KB Output is correct
46 Correct 97 ms 18552 KB Output is correct
47 Correct 332 ms 19576 KB Output is correct
48 Correct 1287 ms 55716 KB Output is correct
49 Correct 1323 ms 54348 KB Output is correct
50 Correct 410 ms 19704 KB Output is correct
51 Correct 368 ms 19832 KB Output is correct
52 Correct 491 ms 19832 KB Output is correct
53 Correct 729 ms 18692 KB Output is correct
54 Correct 1432 ms 34936 KB Output is correct
55 Correct 28 ms 1784 KB Output is correct
56 Correct 16 ms 1272 KB Output is correct
57 Correct 143 ms 9920 KB Output is correct
58 Correct 53 ms 9580 KB Output is correct
59 Correct 402 ms 26460 KB Output is correct
60 Correct 1299 ms 53744 KB Output is correct
61 Incorrect 468 ms 21496 KB Output isn't correct
62 Halted 0 ms 0 KB -