oj.uz

Submission #1097748

# Submission time Handle Problem Language Result Execution time Memory
1097748 2024-10-08T07:15:30 Z SiddharthJoshi6263 Race (IOI11_race) C++17
31 / 100
 279 ms 127412 KB 
#include <bits/stdc++.h>

using namespace std;

// #ifdef ONLINE_JUDGE
// #define debug(...)
// #else
// #include "debug.h"
// #endif

#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) {
    long long big = -1, big_wt = 0;
    for (auto v : adj[u]) {
        if (v.f != par) {
            if (big == -1) {
                big = v.f;
                big_wt = v.s;
            }
            else if (sze[big] < sze[v.f]) {
                big = v.f;
                big_wt = v.s;
            }
        }
    }
    if (big == -1) {
        sets[u].insert({len[u], depth[u]});
        return;
    }
    small_to_large_merging(K, big, u, sze, len, depth, adj, sets);
    multiset<pii> smalls1, smalls2;
    for (auto x : adj[u]) {
        if (x.f != par && x.f != big) {
            small_to_large_merging(K, x.f, u, sze, len, depth, adj, sets);
            long long edge_wt = x.s;
            for (auto y : sets[x.f]) {
                if (y.f - len[x.f] > K)continue;
                long long act_len = y.f - len[x.f] + edge_wt;
                long long act_dep = y.s - depth[x.f] + 1;
                long long find_len = K - act_len;
                if (find_len < 0)continue;
                if (find_len == 0) {
                    ANS = min(ANS, act_dep);
                    continue;
                }
                long long search = find_len + len[u];
                pii finds = {search, -1ll};
                auto vals = smalls1.lower_bound(finds);
                if (vals != smalls1.end()) {
                    if (vals->f == search) {
                        ANS = min(ANS, act_dep + vals->s - depth[u]);
                    }
                }
            }
            for (auto y : sets[x.f]) {
                if (y.f - len[x.f] > K)continue;
                smalls1.insert({y.f - len[x.f] + edge_wt, y.s});
                smalls2.insert({y.f, y.s});
                long long act_len = y.f - len[x.f] + edge_wt + big_wt;
                long long act_dep = y.s - depth[x.f] + 2;
                long long find_len = K - act_len;
                if (find_len < 0)continue;
                if (find_len == 0) {
                    ANS = min(ANS, act_dep);
                    continue;
                }
                long long search = find_len + len[big];
                pii finds = {search, -1ll};
                auto vals = sets[big].lower_bound(finds);
                if (vals != sets[big].end()) {
                    if (vals->f == search) {
                        ANS = min(ANS, act_dep + vals->s - depth[big]);
                    }
                }
            }
            sets[x.f].clear();
        }
    }
    for (auto y : smalls2) {
        sets[big].insert(y);
    }
    sets[u].swap(sets[big]);
    sets[u].insert({len[u], depth[u]});
    pii finds = {K + len[u], -1ll};
    auto vals = sets[u].lower_bound(finds);
    if (vals != sets[u].end()) {
        if (vals->f == K + len[u]) {
            ANS = min(ANS, vals->s - depth[u]);
        }
    }
    sets[big].clear();
}

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]});
    }
    // debug(adj);
    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);
    // debug(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;
}

// void solve() {
//     int n, K;
//     cin >> n >> K;
//     int H[n - 1][2];
//     int L[n - 1];
//     for (long long i = 0; i < n - 1; i++) {
//         cin >> H[i][0] >> H[i][1] >> L[i];
//     }
//     long long ans;
//     cin >> ans;
//     cout << best_path(n, K, H, L) << ' ' << ans << endl;
// }

// signed main() {
//     ios_base::sync_with_stdio(false);
//     cin.tie(NULL);
//     cout.tie(NULL);
//     long long zz = 1;
//     cin >> zz;
//     for (long long i = 1; i <= zz; i++) {
//         // cout << "Case #" << i << ": ";
//         solve();
//     }
//     return 0;
// }

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Incorrect 1 ms 604 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 166 ms 20676 KB Output is correct
20 Correct 149 ms 19620 KB Output is correct
21 Correct 194 ms 24404 KB Output is correct
22 Correct 206 ms 29780 KB Output is correct
23 Correct 68 ms 17744 KB Output is correct
24 Correct 97 ms 17488 KB Output is correct
25 Correct 98 ms 44880 KB Output is correct
26 Correct 85 ms 63828 KB Output is correct
27 Correct 149 ms 36720 KB Output is correct
28 Correct 279 ms 127412 KB Output is correct
29 Correct 245 ms 121632 KB Output is correct
30 Correct 147 ms 36644 KB Output is correct
31 Correct 145 ms 36608 KB Output is correct
32 Correct 174 ms 36392 KB Output is correct
33 Correct 160 ms 35920 KB Output is correct
34 Correct 133 ms 35968 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Incorrect 1 ms 604 KB Output isn't correct
30 Halted 0 ms 0 KB -