oj.uz

Submission #1026126

# Submission time Handle Problem Language Result Execution time Memory
1026126 2024-07-17T15:36:11 Z vanea Race (IOI11_race) C++17
21 / 100
 3000 ms 40644 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int mxN = 2e5+10;
const int mxK = 1e6+10;
const int INF = 1e9+10;
int ans = INF, k, mx;
int d[mxK];

vector<array<int, 2>> adj[mxN];

bool vis[mxN];
int sz[mxN];

void get_sz(int node, int p) {
    sz[node] = 1;
    for(auto [it, w] : adj[node]) {
        if(it == p || vis[it]) continue;
        get_sz(it, node);
        sz[node] += sz[it];
    }
}

int get_c(int node, int p, int n) {
    for(auto [it, w] : adj[node]) {
        if(vis[it] || it == p) continue;
        if(sz[it] * 2 > n) return get_c(it, node, p);
    }
    return node;
}

void get_min(int node, int p, bool filling, int dist, int s, set<int>& st) {
    if(s > k) return ;
    mx = max(mx, s);
    if(filling) {
        if(dist < d[s]) {
            d[s] = dist;
            st.insert(s);
        }
    }
    else {
        ans = min(ans, dist+d[k-s]);
    }
    for(auto [it, w] : adj[node]) {
        if(it == p || vis[it]) continue;
        get_min(it, node, filling, dist+1, s+w, st);
    }
}

void build(int node) {
    get_sz(node, -1);
    int c = get_c(node, -1, sz[node]);
    vis[c] = true;
    set<int> st;
    for(auto [it, w] : adj[c]) {
        if(vis[it]) continue;
        get_min(it, c, 0, 1, w, st);
        get_min(it, c, 1, 1, w, st);
    }
    for(auto it : st) {
        d[it] = INF;
    }
    d[0] = 0;
    for(auto [it, w] : adj[c]) {
        if(vis[it]) continue;
        build(it);
    }
}

int best_path(int n, int K, int h[][2], int l[]) {
    for(int i = 0; i < n-1; i++) {
        adj[h[i][0]].push_back({h[i][1], l[i]});
        adj[h[i][1]].push_back({h[i][0], l[i]});
    }
    fill(d, d+mxK-5, INF);
    d[0] = 0;
    k = K;
    build(0);
    return (ans == INF ? -1 : ans);
}
/*
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout << best_path(11, 12, {{0, 1}, {0, 2}, {2, 3}, {3, 4}, {4, 5}, {0, 6},
                      {6, 7}, {6, 8}, {8, 9}, {8, 10}},
                      {3, 4, 5, 4, 6, 3, 2, 5, 6, 7});
}*/

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13656 KB Output is correct
2 Correct 2 ms 13660 KB Output is correct
3 Correct 2 ms 13660 KB Output is correct
4 Correct 2 ms 13660 KB Output is correct
5 Correct 2 ms 13656 KB Output is correct
6 Correct 2 ms 13660 KB Output is correct
7 Correct 2 ms 13660 KB Output is correct
8 Correct 2 ms 13660 KB Output is correct
9 Correct 2 ms 13660 KB Output is correct
10 Correct 2 ms 13660 KB Output is correct
11 Correct 2 ms 13660 KB Output is correct
12 Correct 2 ms 13660 KB Output is correct
13 Correct 2 ms 13496 KB Output is correct
14 Correct 2 ms 13524 KB Output is correct
15 Correct 2 ms 13660 KB Output is correct
16 Correct 2 ms 13660 KB Output is correct
17 Correct 2 ms 13660 KB Output is correct
18 Correct 2 ms 13656 KB Output is correct
19 Correct 500 ms 20816 KB Output is correct
20 Correct 520 ms 20848 KB Output is correct
21 Correct 815 ms 21644 KB Output is correct
22 Correct 97 ms 19624 KB Output is correct
23 Correct 46 ms 19584 KB Output is correct
24 Correct 39 ms 19548 KB Output is correct
25 Execution timed out 3062 ms 40644 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13656 KB Output is correct
2 Correct 2 ms 13660 KB Output is correct
3 Correct 2 ms 13660 KB Output is correct
4 Correct 2 ms 13660 KB Output is correct
5 Correct 2 ms 13656 KB Output is correct
6 Correct 2 ms 13660 KB Output is correct
7 Correct 2 ms 13660 KB Output is correct
8 Correct 2 ms 13660 KB Output is correct
9 Correct 2 ms 13660 KB Output is correct
10 Correct 2 ms 13660 KB Output is correct
11 Correct 2 ms 13660 KB Output is correct
12 Correct 2 ms 13660 KB Output is correct
13 Correct 2 ms 13496 KB Output is correct
14 Correct 2 ms 13524 KB Output is correct
15 Correct 2 ms 13660 KB Output is correct
16 Correct 2 ms 13660 KB Output is correct
17 Correct 2 ms 13660 KB Output is correct
18 Correct 2 ms 13656 KB Output is correct
19 Correct 2 ms 13660 KB Output is correct
20 Correct 2 ms 13660 KB Output is correct
21 Correct 3 ms 13660 KB Output is correct
22 Correct 2 ms 13660 KB Output is correct
23 Correct 2 ms 13660 KB Output is correct
24 Correct 2 ms 13660 KB Output is correct
25 Correct 3 ms 13660 KB Output is correct
26 Correct 2 ms 13660 KB Output is correct
27 Correct 3 ms 13660 KB Output is correct
28 Correct 4 ms 13656 KB Output is correct
29 Correct 4 ms 13656 KB Output is correct
30 Correct 3 ms 13660 KB Output is correct
31 Correct 3 ms 13660 KB Output is correct
32 Correct 3 ms 13660 KB Output is correct
33 Correct 3 ms 13916 KB Output is correct
34 Correct 3 ms 13660 KB Output is correct
35 Correct 3 ms 13844 KB Output is correct
36 Correct 4 ms 13656 KB Output is correct
37 Correct 4 ms 14168 KB Output is correct
38 Correct 4 ms 13888 KB Output is correct
39 Correct 500 ms 20816 KB Output is correct
40 Correct 520 ms 20848 KB Output is correct
41 Correct 815 ms 21644 KB Output is correct
42 Correct 97 ms 19624 KB Output is correct
43 Correct 46 ms 19584 KB Output is correct
44 Correct 39 ms 19548 KB Output is correct
45 Execution timed out 3062 ms 40644 KB Time limit exceeded
46 Halted 0 ms 0 KB -