oj.uz

Submission #1097825

# Submission time Handle Problem Language Result Execution time Memory
1097825 2024-10-08T09:55:17 Z SiddharthJoshi6263 Race (IOI11_race) C++17
21 / 100
 1230 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;

#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (long long)(x).size()
#define pii pair<long long, long long>

long long ANS = LLONG_MAX;

void dfs_sze(long long u, long long par, vector<vector<pii>> &adj, vector<long long> &sze, vector<long long> &len, vector<long long> &depth) {
    sze[u] = 1;
    for (auto v : adj[u]) {
        if (v.f != par) {
            len[v.f] = len[u] + v.s;
            depth[v.f] = depth[u] + 1;
            dfs_sze(v.f, u, adj, sze, len, depth);
            sze[u] += sze[v.f];
        }
    }
}

void small_to_large_merging(long long K, long long u, long long par, vector<long long> &sze, vector<long long> &len, vector<long long> &depth, vector<vector<pii>> &adj, vector<multiset<pii>> &sets) {
    multiset<pii> smalls1, smalls2;
    for (auto x : adj[u]) {
        if (x.f != par) {
            small_to_large_merging(K, x.f, u, sze, len, depth, adj, sets);
            for (auto y : sets[x.f]) {
                long long len1 = y.f - len[u];
                long long dep = y.s - depth[u];
                pii find = {K - len1, -1ll};
                auto it = smalls2.lower_bound(find);
                if (it != smalls2.end()) {
                    if (it->f == find.f) {
                        ANS = min(ANS, dep + it->s);
                    }
                }
            }
            for (auto y : sets[x.f]) {
                smalls1.insert(y);
                smalls2.insert({y.f - len[u], y.s - depth[u]});
            }
        }
    }
    sets[u] = smalls1;  // Do not clear after this assignment
    sets[u].insert({len[u], depth[u]});  // Include the current node's length and depth

    pii find = {K + len[u], -1ll};
    auto it = sets[u].lower_bound(find);
    if (it != sets[u].end()) {
        if (it->f == find.f) {
            ANS = min(ANS, it->s - depth[u]);
        }
    }
}

int best_path(int N, int k, int H[][2], int L[]) {
    ANS = LLONG_MAX;
    long long n = N, K = k;

    vector<vector<pii>> adj(n);
    for (long long i = 0; i < n - 1; i++) {
        adj[H[i][0]].pb({H[i][1], L[i]});
        adj[H[i][1]].pb({H[i][0], L[i]});
    }

    vector<long long> sze(n, 0);
    vector<long long> len(n, 0);
    vector<long long> depth(n, 0);
    dfs_sze(0, -1, adj, sze, len, depth);

    vector<multiset<pii>> sets(n);
    small_to_large_merging(K, 0, -1, sze, len, depth, adj, sets);

    if (ANS == LLONG_MAX) {
        return -1;
    }
    return ANS;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2712 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 4 ms 3420 KB Output is correct
22 Correct 6 ms 3932 KB Output is correct
23 Correct 7 ms 4440 KB Output is correct
24 Correct 3 ms 3420 KB Output is correct
25 Correct 3 ms 3164 KB Output is correct
26 Correct 3 ms 3416 KB Output is correct
27 Correct 3 ms 3164 KB Output is correct
28 Correct 4 ms 3420 KB Output is correct
29 Correct 3 ms 3164 KB Output is correct
30 Correct 3 ms 3164 KB Output is correct
31 Correct 3 ms 3420 KB Output is correct
32 Correct 3 ms 3420 KB Output is correct
33 Correct 5 ms 3780 KB Output is correct
34 Correct 21 ms 10328 KB Output is correct
35 Correct 26 ms 12424 KB Output is correct
36 Correct 31 ms 13908 KB Output is correct
37 Correct 16 ms 8540 KB Output is correct
38 Correct 11 ms 6492 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2712 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1195 ms 227896 KB Output is correct
20 Correct 1230 ms 237104 KB Output is correct
21 Correct 922 ms 179792 KB Output is correct
22 Correct 868 ms 146768 KB Output is correct
23 Correct 1210 ms 201552 KB Output is correct
24 Correct 580 ms 108628 KB Output is correct
25 Runtime error 963 ms 262144 KB Execution killed with signal 9
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2712 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 4 ms 3420 KB Output is correct
22 Correct 6 ms 3932 KB Output is correct
23 Correct 7 ms 4440 KB Output is correct
24 Correct 3 ms 3420 KB Output is correct
25 Correct 3 ms 3164 KB Output is correct
26 Correct 3 ms 3416 KB Output is correct
27 Correct 3 ms 3164 KB Output is correct
28 Correct 4 ms 3420 KB Output is correct
29 Correct 3 ms 3164 KB Output is correct
30 Correct 3 ms 3164 KB Output is correct
31 Correct 3 ms 3420 KB Output is correct
32 Correct 3 ms 3420 KB Output is correct
33 Correct 5 ms 3780 KB Output is correct
34 Correct 21 ms 10328 KB Output is correct
35 Correct 26 ms 12424 KB Output is correct
36 Correct 31 ms 13908 KB Output is correct
37 Correct 16 ms 8540 KB Output is correct
38 Correct 11 ms 6492 KB Output is correct
39 Correct 1195 ms 227896 KB Output is correct
40 Correct 1230 ms 237104 KB Output is correct
41 Correct 922 ms 179792 KB Output is correct
42 Correct 868 ms 146768 KB Output is correct
43 Correct 1210 ms 201552 KB Output is correct
44 Correct 580 ms 108628 KB Output is correct
45 Runtime error 963 ms 262144 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -