oj.uz

Submission #977217

# Submission time Handle Problem Language Result Execution time Memory
977217 2024-05-07T14:17:43 Z saayan007 Race (IOI11_race) C++17
100 / 100
 415 ms 36308 KB 
#include "race.h"
#include "bits/stdc++.h"
using namespace std;
#warning notusing64bitintegers

#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define repd(i, a, b) for(int i = (a); i >= (b); --i)

#define em emplace
#define eb emplace_back

const int mxN = 2e5L + 10;
const int mxK = 1e6L + 10;
int n, k;
vector<pair<int, int>> adj[mxN];
int ans = mxN;
int sz[mxN];
bool proc[mxN] = {};
int dp[mxK];

int get_sz(int x, int p) {
    sz[x] = 1;
    for(auto [y, w] : adj[x]) {
        if(proc[y] || y == p) continue;
        sz[x] += get_sz(y, x);
    }
    return sz[x];
}

int get_cen(int x, int p, int tot) {
    for(auto [y, w] : adj[x]) {
        if(proc[y] || y == p || sz[y] * 2 <= tot) continue;
        return get_cen(y, x, tot);
    }
    return x;
}

void dfs(int x, int p, int dep, int dis, int flag) {
    if(dis > k) return;
    if(flag == 0) {
        if(dp[k - dis] != mxN) ans = min(ans, dep + dp[k - dis]);
    }
    else if(flag == 1) {
        dp[dis] = min(dp[dis], dep);
    }
    else if(flag == 2) {
        dp[dis] = mxN;
    }

    for(auto [y, w] : adj[x]) {
        if(proc[y] || y == p) continue;
        dfs(y, x, dep + 1, dis + w, flag);
    }
}

void solve(int x = 1, int p = -1) {
    int c = get_cen(x, p, get_sz(x, p));
    dp[0] = 0;
    for(auto [d, w] : adj[c]) {
        if(proc[d]) continue;
        dfs(d, c, 1, w, 0);
        dfs(d, c, 1, w, 1);
    }
    for(auto [d, w] : adj[c]) {
        if(proc[d]) continue;
        dfs(d, c, 1, w, 2);
    }
    dp[0] = mxN;
    proc[c] = 1;
    for(auto [d, w] : adj[c]) {
        if(proc[d]) continue;
        solve(d, c);
    }
}

int best_path(int N, int K, int H[][2], int L[])
{
    rep(i, 0, mxK - 1) dp[i] = mxN;
    n = N; k = K;
    rep(i, 0, n - 2) {
        adj[H[i][0] + 1].eb(H[i][1] + 1, L[i]);
        adj[H[i][1] + 1].eb(H[i][0] + 1, L[i]);
    }

    solve();
    return (ans > n - 1 ? -1 : ans);
}

Compilation message

race.cpp:4:2: warning: #warning notusing64bitintegers [-Wcpp]
    4 | #warning notusing64bitintegers
      |  ^~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13912 KB Output is correct
2 Correct 2 ms 13912 KB Output is correct
3 Correct 3 ms 13660 KB Output is correct
4 Correct 3 ms 13496 KB Output is correct
5 Correct 4 ms 13660 KB Output is correct
6 Correct 3 ms 13660 KB Output is correct
7 Correct 3 ms 13660 KB Output is correct
8 Correct 4 ms 13656 KB Output is correct
9 Correct 3 ms 13660 KB Output is correct
10 Correct 3 ms 13660 KB Output is correct
11 Correct 3 ms 13656 KB Output is correct
12 Correct 3 ms 13656 KB Output is correct
13 Correct 3 ms 13660 KB Output is correct
14 Correct 4 ms 13660 KB Output is correct
15 Correct 3 ms 13660 KB Output is correct
16 Correct 3 ms 13660 KB Output is correct
17 Correct 3 ms 13660 KB Output is correct
18 Correct 3 ms 13660 KB Output is correct
19 Correct 3 ms 13660 KB Output is correct
20 Correct 3 ms 13656 KB Output is correct
21 Correct 4 ms 13660 KB Output is correct
22 Correct 3 ms 13660 KB Output is correct
23 Correct 3 ms 13660 KB Output is correct
24 Correct 4 ms 13672 KB Output is correct
25 Correct 3 ms 13660 KB Output is correct
26 Correct 3 ms 13660 KB Output is correct
27 Correct 4 ms 13656 KB Output is correct
28 Correct 4 ms 13888 KB Output is correct
29 Correct 4 ms 13660 KB Output is correct
30 Correct 4 ms 13556 KB Output is correct
31 Correct 3 ms 13656 KB Output is correct
32 Correct 4 ms 13656 KB Output is correct
33 Correct 3 ms 13660 KB Output is correct
34 Correct 4 ms 13660 KB Output is correct
35 Correct 3 ms 13660 KB Output is correct
36 Correct 4 ms 13660 KB Output is correct
37 Correct 3 ms 13660 KB Output is correct
38 Correct 3 ms 13660 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13912 KB Output is correct
2 Correct 2 ms 13912 KB Output is correct
3 Correct 3 ms 13660 KB Output is correct
4 Correct 3 ms 13496 KB Output is correct
5 Correct 4 ms 13660 KB Output is correct
6 Correct 3 ms 13660 KB Output is correct
7 Correct 3 ms 13660 KB Output is correct
8 Correct 4 ms 13656 KB Output is correct
9 Correct 3 ms 13660 KB Output is correct
10 Correct 3 ms 13660 KB Output is correct
11 Correct 3 ms 13656 KB Output is correct
12 Correct 3 ms 13656 KB Output is correct
13 Correct 3 ms 13660 KB Output is correct
14 Correct 4 ms 13660 KB Output is correct
15 Correct 3 ms 13660 KB Output is correct
16 Correct 3 ms 13660 KB Output is correct
17 Correct 3 ms 13660 KB Output is correct
18 Correct 3 ms 13660 KB Output is correct
19 Correct 107 ms 19720 KB Output is correct
20 Correct 89 ms 20604 KB Output is correct
21 Correct 99 ms 20056 KB Output is correct
22 Correct 85 ms 20836 KB Output is correct
23 Correct 55 ms 21224 KB Output is correct
24 Correct 41 ms 20816 KB Output is correct
25 Correct 121 ms 23460 KB Output is correct
26 Correct 77 ms 25936 KB Output is correct
27 Correct 117 ms 24916 KB Output is correct
28 Correct 175 ms 36308 KB Output is correct
29 Correct 164 ms 35716 KB Output is correct
30 Correct 109 ms 25428 KB Output is correct
31 Correct 154 ms 25428 KB Output is correct
32 Correct 114 ms 25428 KB Output is correct
33 Correct 143 ms 24404 KB Output is correct
34 Correct 114 ms 24864 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13912 KB Output is correct
2 Correct 2 ms 13912 KB Output is correct
3 Correct 3 ms 13660 KB Output is correct
4 Correct 3 ms 13496 KB Output is correct
5 Correct 4 ms 13660 KB Output is correct
6 Correct 3 ms 13660 KB Output is correct
7 Correct 3 ms 13660 KB Output is correct
8 Correct 4 ms 13656 KB Output is correct
9 Correct 3 ms 13660 KB Output is correct
10 Correct 3 ms 13660 KB Output is correct
11 Correct 3 ms 13656 KB Output is correct
12 Correct 3 ms 13656 KB Output is correct
13 Correct 3 ms 13660 KB Output is correct
14 Correct 4 ms 13660 KB Output is correct
15 Correct 3 ms 13660 KB Output is correct
16 Correct 3 ms 13660 KB Output is correct
17 Correct 3 ms 13660 KB Output is correct
18 Correct 3 ms 13660 KB Output is correct
19 Correct 3 ms 13660 KB Output is correct
20 Correct 3 ms 13656 KB Output is correct
21 Correct 4 ms 13660 KB Output is correct
22 Correct 3 ms 13660 KB Output is correct
23 Correct 3 ms 13660 KB Output is correct
24 Correct 4 ms 13672 KB Output is correct
25 Correct 3 ms 13660 KB Output is correct
26 Correct 3 ms 13660 KB Output is correct
27 Correct 4 ms 13656 KB Output is correct
28 Correct 4 ms 13888 KB Output is correct
29 Correct 4 ms 13660 KB Output is correct
30 Correct 4 ms 13556 KB Output is correct
31 Correct 3 ms 13656 KB Output is correct
32 Correct 4 ms 13656 KB Output is correct
33 Correct 3 ms 13660 KB Output is correct
34 Correct 4 ms 13660 KB Output is correct
35 Correct 3 ms 13660 KB Output is correct
36 Correct 4 ms 13660 KB Output is correct
37 Correct 3 ms 13660 KB Output is correct
38 Correct 3 ms 13660 KB Output is correct
39 Correct 107 ms 19720 KB Output is correct
40 Correct 89 ms 20604 KB Output is correct
41 Correct 99 ms 20056 KB Output is correct
42 Correct 85 ms 20836 KB Output is correct
43 Correct 55 ms 21224 KB Output is correct
44 Correct 41 ms 20816 KB Output is correct
45 Correct 121 ms 23460 KB Output is correct
46 Correct 77 ms 25936 KB Output is correct
47 Correct 117 ms 24916 KB Output is correct
48 Correct 175 ms 36308 KB Output is correct
49 Correct 164 ms 35716 KB Output is correct
50 Correct 109 ms 25428 KB Output is correct
51 Correct 154 ms 25428 KB Output is correct
52 Correct 114 ms 25428 KB Output is correct
53 Correct 143 ms 24404 KB Output is correct
54 Correct 114 ms 24864 KB Output is correct
55 Correct 9 ms 13916 KB Output is correct
56 Correct 10 ms 13916 KB Output is correct
57 Correct 60 ms 19836 KB Output is correct
58 Correct 28 ms 20684 KB Output is correct
59 Correct 79 ms 26136 KB Output is correct
60 Correct 415 ms 35908 KB Output is correct
61 Correct 151 ms 24916 KB Output is correct
62 Correct 159 ms 25688 KB Output is correct
63 Correct 176 ms 25424 KB Output is correct
64 Correct 317 ms 24176 KB Output is correct
65 Correct 145 ms 26548 KB Output is correct
66 Correct 234 ms 31572 KB Output is correct
67 Correct 123 ms 26844 KB Output is correct
68 Correct 224 ms 26192 KB Output is correct
69 Correct 153 ms 23892 KB Output is correct
70 Correct 152 ms 25936 KB Output is correct