oj.uz

Submission #990366

# Submission time Handle Problem Language Result Execution time Memory
990366 2024-05-30T10:18:07 Z stdfloat Race (IOI11_race) C++17
43 / 100
 3000 ms 33620 KB 
#include <bits/stdc++.h>
#include "race.h"
using namespace std;

using ll = long long;

#define ff  first
#define ss  second
#define pii pair<int, int>

int k, mn = INT_MAX;

vector<int> sz;

map<int, int> m;

vector<bool> vis;

vector<vector<pii>> v, E;

int dfs_sz(int x, int p = -1) {
    sz[x] = 1;
    for (auto [i, w] : E[x]) {
        if (i != p && !vis[i]) sz[x] += dfs_sz(i, x);
    }

    return sz[x];
}

int ctrd(int x, int p, int n) {
    for (auto [i, w] : E[x]) {
        if (i != p && !vis[i] && sz[i] > (n >> 1)) return ctrd(i, x, n);
    }

    return x;
}

void dfs(int x, int p, int d1, int d2) {
    for (auto [i, w] : E[x]) {
        // cout << "xi " << i << ' ' << vis[i] << ' ' << w << ' ' << d2 << endl;
        if (i != p && !vis[i] && w <= k - d2) {
        // cout << "xi " << i << ' ' << vis[i] << ' ' << w << ' ' << d2 << endl;
            // if (m.find(d2 + w) == m.end()) m[d2 + w] = d1 + 1;
            // else m2[d2 + w] = min(m2[d2 + w], d1 + 1);

            m[d2 + w] = min((m[d2 + w] ? m[d2 + w] : INT_MAX), d1 + 1);
            dfs(i, x, d1 + 1, d2 + w);
        }
    }
}

void f(int x, int p = -1) {
    int n = dfs_sz(x), c = ctrd(x, p, n);

    vis[c] = true;

    // cout << "\nn " << n << ' ' << c << endl;

    map<int, int> M; M[0] = 0;
    for (auto [i, w] : E[c]) {
        // m.clear();
        // m[w] = 1;
        m = {{w, 1}};
        dfs(i, c, 1, w);

        // cout << "ci " << i << ' ' << w << endl;
    
        for (auto i : m) {
            if (M.find(k - i.ff) != M.end()) mn = min(mn, M[k - i.ff] + i.ss);
            // cout << "i.ff " << i.ff << ' ' << i.ss << endl;
        }
        for (auto i : m)
            M[i.ff] = min((M[i.ff] ? M[i.ff] : INT_MAX), i.ss);
    }

    for (auto [i, w] : E[c])
        if (!vis[i]) f(i, c);
}

int best_path(int N, int K, int H[][2], int L[]) {
    k = K;
    E.assign(N, {});
    for (int i = 0; i < N - 1; i++) {
        E[H[i][0]].push_back({H[i][1], L[i]});
        E[H[i][1]].push_back({H[i][0], L[i]});
    }

    sz.assign(N, 0);
    vis.assign(N, false);
    f(0);

    return (mn == INT_MAX ? -1 : mn);
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 3 ms 2620 KB Output is correct
22 Correct 1 ms 2500 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 3 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 3 ms 2652 KB Output is correct
30 Correct 3 ms 2648 KB Output is correct
31 Correct 3 ms 2652 KB Output is correct
32 Correct 3 ms 2652 KB Output is correct
33 Correct 3 ms 2652 KB Output is correct
34 Correct 2 ms 2392 KB Output is correct
35 Correct 2 ms 2396 KB Output is correct
36 Correct 2 ms 2396 KB Output is correct
37 Correct 2 ms 2652 KB Output is correct
38 Correct 3 ms 2648 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 236 ms 11092 KB Output is correct
20 Correct 220 ms 12112 KB Output is correct
21 Correct 240 ms 11836 KB Output is correct
22 Correct 247 ms 12380 KB Output is correct
23 Correct 68 ms 12636 KB Output is correct
24 Correct 92 ms 12380 KB Output is correct
25 Correct 108 ms 15780 KB Output is correct
26 Correct 73 ms 19024 KB Output is correct
27 Correct 719 ms 19288 KB Output is correct
28 Correct 169 ms 33620 KB Output is correct
29 Correct 165 ms 32848 KB Output is correct
30 Correct 738 ms 19792 KB Output is correct
31 Correct 727 ms 19792 KB Output is correct
32 Correct 670 ms 19792 KB Output is correct
33 Correct 274 ms 18772 KB Output is correct
34 Correct 117 ms 19024 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 3 ms 2620 KB Output is correct
22 Correct 1 ms 2500 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 3 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 3 ms 2652 KB Output is correct
30 Correct 3 ms 2648 KB Output is correct
31 Correct 3 ms 2652 KB Output is correct
32 Correct 3 ms 2652 KB Output is correct
33 Correct 3 ms 2652 KB Output is correct
34 Correct 2 ms 2392 KB Output is correct
35 Correct 2 ms 2396 KB Output is correct
36 Correct 2 ms 2396 KB Output is correct
37 Correct 2 ms 2652 KB Output is correct
38 Correct 3 ms 2648 KB Output is correct
39 Correct 236 ms 11092 KB Output is correct
40 Correct 220 ms 12112 KB Output is correct
41 Correct 240 ms 11836 KB Output is correct
42 Correct 247 ms 12380 KB Output is correct
43 Correct 68 ms 12636 KB Output is correct
44 Correct 92 ms 12380 KB Output is correct
45 Correct 108 ms 15780 KB Output is correct
46 Correct 73 ms 19024 KB Output is correct
47 Correct 719 ms 19288 KB Output is correct
48 Correct 169 ms 33620 KB Output is correct
49 Correct 165 ms 32848 KB Output is correct
50 Correct 738 ms 19792 KB Output is correct
51 Correct 727 ms 19792 KB Output is correct
52 Correct 670 ms 19792 KB Output is correct
53 Correct 274 ms 18772 KB Output is correct
54 Correct 117 ms 19024 KB Output is correct
55 Correct 34 ms 3676 KB Output is correct
56 Correct 17 ms 3164 KB Output is correct
57 Correct 132 ms 11576 KB Output is correct
58 Execution timed out 3053 ms 12236 KB Time limit exceeded
59 Halted 0 ms 0 KB -