oj.uz

Submission #661142

# Submission time Handle Problem Language Result Execution time Memory
661142 2022-11-24T16:22:59 Z borisAngelov Race (IOI11_race) C++11
100 / 100
 460 ms 103952 KB 
#include <iostream>
#include <utility>
#include <vector>
#include <tuple>
#include <map>
#include "race.h"

using namespace std;

const int maxn = 200005;
const int inf = 1000000000;

int H[maxn][2];
int L[maxn];

int n;
long long k;

vector<pair<int, int>> g[maxn];

long long pathToRoot[maxn];
int depth[maxn];

map<long long, int> info[maxn];

void dfs_precompute(int node, int parent, long long currPath, int currDepth) {
    pathToRoot[node] = currPath;
    depth[node] = currDepth;
    info[node][currPath] = currDepth;

    for (auto [v, w] : g[node]) {
        if (v == parent) continue;

        dfs_precompute(v, node, currPath + w, currDepth + 1);
    }
}

int ans = inf;

void dfs_small_to_large(int node, int parent) {
    long long target = k + 2 * pathToRoot[node];

    for (auto [v, w] : g[node]) {
        if (v == parent) continue;

        dfs_small_to_large(v, node);

        if (info[node].size() < info[v].size()) {
            swap(info[node], info[v]);
        }

        for (auto [dist, edges] : info[v]) {
            if (info[node].find(target - dist) != info[node].end()) {
                ans = min(ans, info[node][target - dist] + edges - 2 * depth[node]);
            }
        }

        for (auto [dist, edges] : info[v]) {
            if (info[node].find(dist) == info[node].end()) {
                info[node].insert({dist, edges});
            } else {
                info[node][dist] = min(info[node][dist], edges);
            }
        }
    }
}

int best_path(int A, int B, int edges[][2], int weights[]) {
    n = A;
    k = B;

    for (int i = 0; i < n - 1; ++i) {
        int u = edges[i][0];
        int v = edges[i][1];
        int w = weights[i];

        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }

    dfs_precompute(0, -1, 0, 0);
    dfs_small_to_large(0, -1);

    if (ans == inf) return -1;
    return ans;
}

Compilation message

race.cpp: In function 'void dfs_precompute(int, int, long long int, int)':
race.cpp:31:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |     for (auto [v, w] : g[node]) {
      |               ^
race.cpp: In function 'void dfs_small_to_large(int, int)':
race.cpp:43:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   43 |     for (auto [v, w] : g[node]) {
      |               ^
race.cpp:52:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   52 |         for (auto [dist, edges] : info[v]) {
      |                   ^
race.cpp:58:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |         for (auto [dist, edges] : info[v]) {
      |                   ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14368 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14364 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 9 ms 14420 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 8 ms 14376 KB Output is correct
9 Correct 7 ms 14424 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14344 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 7 ms 14460 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 8 ms 14548 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14368 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14364 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 9 ms 14420 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 8 ms 14376 KB Output is correct
9 Correct 7 ms 14424 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14344 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 7 ms 14460 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 8 ms 14548 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 9 ms 14680 KB Output is correct
22 Correct 9 ms 14676 KB Output is correct
23 Correct 8 ms 14688 KB Output is correct
24 Correct 9 ms 14700 KB Output is correct
25 Correct 8 ms 14676 KB Output is correct
26 Correct 9 ms 14664 KB Output is correct
27 Correct 9 ms 14560 KB Output is correct
28 Correct 9 ms 14676 KB Output is correct
29 Correct 9 ms 14664 KB Output is correct
30 Correct 9 ms 14696 KB Output is correct
31 Correct 9 ms 14676 KB Output is correct
32 Correct 9 ms 14688 KB Output is correct
33 Correct 9 ms 14688 KB Output is correct
34 Correct 8 ms 14676 KB Output is correct
35 Correct 10 ms 14676 KB Output is correct
36 Correct 8 ms 14676 KB Output is correct
37 Correct 9 ms 14548 KB Output is correct
38 Correct 8 ms 14676 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14368 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14364 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 9 ms 14420 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 8 ms 14376 KB Output is correct
9 Correct 7 ms 14424 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14344 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 7 ms 14460 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 8 ms 14548 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 129 ms 37324 KB Output is correct
20 Correct 130 ms 37364 KB Output is correct
21 Correct 134 ms 37220 KB Output is correct
22 Correct 140 ms 36692 KB Output is correct
23 Correct 159 ms 49432 KB Output is correct
24 Correct 126 ms 40140 KB Output is correct
25 Correct 114 ms 38032 KB Output is correct
26 Correct 67 ms 46288 KB Output is correct
27 Correct 201 ms 48588 KB Output is correct
28 Correct 317 ms 90944 KB Output is correct
29 Correct 302 ms 89036 KB Output is correct
30 Correct 196 ms 48672 KB Output is correct
31 Correct 218 ms 48664 KB Output is correct
32 Correct 300 ms 48892 KB Output is correct
33 Correct 269 ms 53584 KB Output is correct
34 Correct 347 ms 86536 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14368 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14364 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 9 ms 14420 KB Output is correct
7 Correct 9 ms 14420 KB Output is correct
8 Correct 8 ms 14376 KB Output is correct
9 Correct 7 ms 14424 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14344 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 7 ms 14460 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 8 ms 14548 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 9 ms 14680 KB Output is correct
22 Correct 9 ms 14676 KB Output is correct
23 Correct 8 ms 14688 KB Output is correct
24 Correct 9 ms 14700 KB Output is correct
25 Correct 8 ms 14676 KB Output is correct
26 Correct 9 ms 14664 KB Output is correct
27 Correct 9 ms 14560 KB Output is correct
28 Correct 9 ms 14676 KB Output is correct
29 Correct 9 ms 14664 KB Output is correct
30 Correct 9 ms 14696 KB Output is correct
31 Correct 9 ms 14676 KB Output is correct
32 Correct 9 ms 14688 KB Output is correct
33 Correct 9 ms 14688 KB Output is correct
34 Correct 8 ms 14676 KB Output is correct
35 Correct 10 ms 14676 KB Output is correct
36 Correct 8 ms 14676 KB Output is correct
37 Correct 9 ms 14548 KB Output is correct
38 Correct 8 ms 14676 KB Output is correct
39 Correct 129 ms 37324 KB Output is correct
40 Correct 130 ms 37364 KB Output is correct
41 Correct 134 ms 37220 KB Output is correct
42 Correct 140 ms 36692 KB Output is correct
43 Correct 159 ms 49432 KB Output is correct
44 Correct 126 ms 40140 KB Output is correct
45 Correct 114 ms 38032 KB Output is correct
46 Correct 67 ms 46288 KB Output is correct
47 Correct 201 ms 48588 KB Output is correct
48 Correct 317 ms 90944 KB Output is correct
49 Correct 302 ms 89036 KB Output is correct
50 Correct 196 ms 48672 KB Output is correct
51 Correct 218 ms 48664 KB Output is correct
52 Correct 300 ms 48892 KB Output is correct
53 Correct 269 ms 53584 KB Output is correct
54 Correct 347 ms 86536 KB Output is correct
55 Correct 21 ms 17620 KB Output is correct
56 Correct 15 ms 16340 KB Output is correct
57 Correct 75 ms 34740 KB Output is correct
58 Correct 50 ms 27900 KB Output is correct
59 Correct 102 ms 52448 KB Output is correct
60 Correct 286 ms 89468 KB Output is correct
61 Correct 228 ms 52200 KB Output is correct
62 Correct 203 ms 48716 KB Output is correct
63 Correct 293 ms 48816 KB Output is correct
64 Correct 460 ms 103952 KB Output is correct
65 Correct 444 ms 101940 KB Output is correct
66 Correct 330 ms 85196 KB Output is correct
67 Correct 206 ms 43156 KB Output is correct
68 Correct 371 ms 65700 KB Output is correct
69 Correct 390 ms 70872 KB Output is correct
70 Correct 363 ms 63568 KB Output is correct