oj.uz

Submission #1026181

# Submission time Handle Problem Language Result Execution time Memory
1026181 2024-07-17T16:47:20 Z vanea Race (IOI11_race) C++14
100 / 100
 253 ms 40420 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;

vector<array<int, 2>> adj[mxN];
int bk = 0, k, ans = INF;
int sz[mxN], d[mxK], last[mxK];
bool vis[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, n);
    }
    return node;
}

void get_dist(int node, int p, bool filling, int dist, int s) {
    if(s > k) return;
    if(filling) {
        if(last[s] != bk) {
            d[s] = dist;
            last[s] = bk;
        }
        else {
            d[s] = min(d[s], dist);
        }
    }
    else {
        if(last[k-s] == bk) {
            ans = min(ans, dist+d[k-s]);
        }
    }
    for(auto [it, w] : adj[node]) {
        if(it == p || vis[it]) continue;
        get_dist(it, node, filling, dist+1, s+w);
    }
}

void build(int node) {
    get_sz(node, -1);
    int c = get_c(node, -1, sz[node]);
    vis[c] = true;
    ++bk;
    last[0] = bk;
    for(auto [it, w] : adj[c]) {
        if(vis[it]) continue;
        get_dist(it, c, 0, 1, w);
        get_dist(it, c, 1, 1, w);
    }
    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]});
    }
    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});
}*/

Compilation message

race.cpp: In function 'void get_sz(int, int)':
race.cpp:16:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   16 |     for(auto [it, w] : adj[node]) {
      |              ^
race.cpp: In function 'int get_c(int, int, int)':
race.cpp:24:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |     for(auto [it, w] : adj[node]) {
      |              ^
race.cpp: In function 'void get_dist(int, int, bool, int, int)':
race.cpp:47:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   47 |     for(auto [it, w] : adj[node]) {
      |              ^
race.cpp: In function 'void build(int)':
race.cpp:59:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   59 |     for(auto [it, w] : adj[c]) {
      |              ^
race.cpp:64:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |     for(auto [it, w] : adj[c]) {
      |              ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 2 ms 13404 KB Output is correct
3 Correct 2 ms 13404 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 2 ms 11356 KB Output is correct
6 Correct 3 ms 13492 KB Output is correct
7 Correct 2 ms 13404 KB Output is correct
8 Correct 2 ms 13404 KB Output is correct
9 Correct 1 ms 11440 KB Output is correct
10 Correct 2 ms 11356 KB Output is correct
11 Correct 2 ms 13404 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 2 ms 13404 KB Output is correct
14 Correct 2 ms 13404 KB Output is correct
15 Correct 2 ms 11356 KB Output is correct
16 Correct 2 ms 13404 KB Output is correct
17 Correct 2 ms 13404 KB Output is correct
18 Correct 2 ms 11356 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 2 ms 13404 KB Output is correct
3 Correct 2 ms 13404 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 2 ms 11356 KB Output is correct
6 Correct 3 ms 13492 KB Output is correct
7 Correct 2 ms 13404 KB Output is correct
8 Correct 2 ms 13404 KB Output is correct
9 Correct 1 ms 11440 KB Output is correct
10 Correct 2 ms 11356 KB Output is correct
11 Correct 2 ms 13404 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 2 ms 13404 KB Output is correct
14 Correct 2 ms 13404 KB Output is correct
15 Correct 2 ms 11356 KB Output is correct
16 Correct 2 ms 13404 KB Output is correct
17 Correct 2 ms 13404 KB Output is correct
18 Correct 2 ms 11356 KB Output is correct
19 Correct 2 ms 11356 KB Output is correct
20 Correct 3 ms 13400 KB Output is correct
21 Correct 2 ms 13404 KB Output is correct
22 Correct 4 ms 15972 KB Output is correct
23 Correct 3 ms 15708 KB Output is correct
24 Correct 4 ms 16476 KB Output is correct
25 Correct 3 ms 15452 KB Output is correct
26 Correct 4 ms 16624 KB Output is correct
27 Correct 3 ms 11412 KB Output is correct
28 Correct 3 ms 15964 KB Output is correct
29 Correct 3 ms 16472 KB Output is correct
30 Correct 3 ms 16476 KB Output is correct
31 Correct 4 ms 15452 KB Output is correct
32 Correct 3 ms 15452 KB Output is correct
33 Correct 4 ms 16220 KB Output is correct
34 Correct 3 ms 17500 KB Output is correct
35 Correct 4 ms 16568 KB Output is correct
36 Correct 4 ms 16988 KB Output is correct
37 Correct 4 ms 15452 KB Output is correct
38 Correct 3 ms 16292 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 2 ms 13404 KB Output is correct
3 Correct 2 ms 13404 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 2 ms 11356 KB Output is correct
6 Correct 3 ms 13492 KB Output is correct
7 Correct 2 ms 13404 KB Output is correct
8 Correct 2 ms 13404 KB Output is correct
9 Correct 1 ms 11440 KB Output is correct
10 Correct 2 ms 11356 KB Output is correct
11 Correct 2 ms 13404 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 2 ms 13404 KB Output is correct
14 Correct 2 ms 13404 KB Output is correct
15 Correct 2 ms 11356 KB Output is correct
16 Correct 2 ms 13404 KB Output is correct
17 Correct 2 ms 13404 KB Output is correct
18 Correct 2 ms 11356 KB Output is correct
19 Correct 72 ms 17236 KB Output is correct
20 Correct 99 ms 18000 KB Output is correct
21 Correct 76 ms 17836 KB Output is correct
22 Correct 65 ms 18396 KB Output is correct
23 Correct 39 ms 20560 KB Output is correct
24 Correct 38 ms 18512 KB Output is correct
25 Correct 104 ms 21448 KB Output is correct
26 Correct 91 ms 24956 KB Output is correct
27 Correct 101 ms 24064 KB Output is correct
28 Correct 141 ms 38316 KB Output is correct
29 Correct 166 ms 37608 KB Output is correct
30 Correct 96 ms 24468 KB Output is correct
31 Correct 88 ms 24400 KB Output is correct
32 Correct 102 ms 24564 KB Output is correct
33 Correct 126 ms 21328 KB Output is correct
34 Correct 141 ms 23584 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 2 ms 13404 KB Output is correct
3 Correct 2 ms 13404 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 2 ms 11356 KB Output is correct
6 Correct 3 ms 13492 KB Output is correct
7 Correct 2 ms 13404 KB Output is correct
8 Correct 2 ms 13404 KB Output is correct
9 Correct 1 ms 11440 KB Output is correct
10 Correct 2 ms 11356 KB Output is correct
11 Correct 2 ms 13404 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 2 ms 13404 KB Output is correct
14 Correct 2 ms 13404 KB Output is correct
15 Correct 2 ms 11356 KB Output is correct
16 Correct 2 ms 13404 KB Output is correct
17 Correct 2 ms 13404 KB Output is correct
18 Correct 2 ms 11356 KB Output is correct
19 Correct 2 ms 11356 KB Output is correct
20 Correct 3 ms 13400 KB Output is correct
21 Correct 2 ms 13404 KB Output is correct
22 Correct 4 ms 15972 KB Output is correct
23 Correct 3 ms 15708 KB Output is correct
24 Correct 4 ms 16476 KB Output is correct
25 Correct 3 ms 15452 KB Output is correct
26 Correct 4 ms 16624 KB Output is correct
27 Correct 3 ms 11412 KB Output is correct
28 Correct 3 ms 15964 KB Output is correct
29 Correct 3 ms 16472 KB Output is correct
30 Correct 3 ms 16476 KB Output is correct
31 Correct 4 ms 15452 KB Output is correct
32 Correct 3 ms 15452 KB Output is correct
33 Correct 4 ms 16220 KB Output is correct
34 Correct 3 ms 17500 KB Output is correct
35 Correct 4 ms 16568 KB Output is correct
36 Correct 4 ms 16988 KB Output is correct
37 Correct 4 ms 15452 KB Output is correct
38 Correct 3 ms 16292 KB Output is correct
39 Correct 72 ms 17236 KB Output is correct
40 Correct 99 ms 18000 KB Output is correct
41 Correct 76 ms 17836 KB Output is correct
42 Correct 65 ms 18396 KB Output is correct
43 Correct 39 ms 20560 KB Output is correct
44 Correct 38 ms 18512 KB Output is correct
45 Correct 104 ms 21448 KB Output is correct
46 Correct 91 ms 24956 KB Output is correct
47 Correct 101 ms 24064 KB Output is correct
48 Correct 141 ms 38316 KB Output is correct
49 Correct 166 ms 37608 KB Output is correct
50 Correct 96 ms 24468 KB Output is correct
51 Correct 88 ms 24400 KB Output is correct
52 Correct 102 ms 24564 KB Output is correct
53 Correct 126 ms 21328 KB Output is correct
54 Correct 141 ms 23584 KB Output is correct
55 Correct 7 ms 13912 KB Output is correct
56 Correct 8 ms 13660 KB Output is correct
57 Correct 51 ms 19668 KB Output is correct
58 Correct 32 ms 20164 KB Output is correct
59 Correct 64 ms 27472 KB Output is correct
60 Correct 229 ms 40420 KB Output is correct
61 Correct 127 ms 24144 KB Output is correct
62 Correct 110 ms 22424 KB Output is correct
63 Correct 124 ms 22356 KB Output is correct
64 Correct 253 ms 26600 KB Output is correct
65 Correct 135 ms 24912 KB Output is correct
66 Correct 213 ms 37976 KB Output is correct
67 Correct 54 ms 23488 KB Output is correct
68 Correct 160 ms 27652 KB Output is correct
69 Correct 107 ms 26604 KB Output is correct
70 Correct 121 ms 27484 KB Output is correct