oj.uz

Submission #908208

# Submission time Handle Problem Language Result Execution time Memory
908208 2024-01-16T09:34:15 Z typ_ik Factories (JOI14_factories) C++17
100 / 100
 3900 ms 182888 KB 
#include <bits/stdc++.h>
#include "factories.h"

#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define watch(x) cout << (#x) << " : " << x << '\n'
#define boost ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std; 

const int N = 5e5 + 128;
const ll INF = 1e15 + 128; 
const int LOG = 20;
vector < pair<int, int> > g[N];
int n, q;
bool was[N];
int h[N]; 
ll res[N];  

void dfs(int v, int p = -1) {
    h[v] = 1;    

    for (auto& [to, len] : g[v])
        if (to != p && !was[to])
            dfs(to, v), h[v] += h[to];
}  

int p[N];
ll dist[N][LOG];
int depth[N];

void calc(int v, int dep, ll val, int pr = -1) {
    dist[v][dep] = val;

    for (auto& [to, len] : g[v])
        if (to != pr && !was[to])
            calc(to, dep, val+len, v);
} 

int find_centroid(int v, int pr, int sz) { 
    for (auto& [to, len] : g[v])
        if (to != pr && h[to] > sz / 2 && !was[to])
            return find_centroid(to, v, sz);
    return v;
} 

void decompose(int v, int pr = -1) { 
    dfs(v); 

    int c = find_centroid(v, -1, h[v]);

    p[c] = pr;    

    if (pr != -1)
        depth[c] = depth[pr] + 1;

    calc(c, depth[c], 0);
    was[c] = true;

    for (auto& [to, len] : g[c])
        if (!was[to])
            decompose(to, c);
}

void update(int v) {
    int c = v;
    while (c != -1)
        res[c] = min(res[c], dist[v][depth[c]]), c = p[c]; 
}

void reset(int v) {
    int c = v;
    while (c != -1)
        res[c] = INF, c = p[c]; 
}

ll get(int v) {
    ll ans = INF;
    int c = v;
    while (c != -1)
        ans = min(ans, dist[v][depth[c]] + res[c]), c = p[c]; 
    return ans;
}

void Init(int N, int A[], int B[], int D[]) {
    n = N;
    for (int i = 0; i + 1 < n; i++) {
        int u = A[i], v = B[i], w = D[i];
        g[u].push_back(make_pair(v, w));
        g[v].push_back(make_pair(u, w));
    }
    for (int i = 0; i <= n; i++)
        res[i] = INF;
    decompose(1); 
}

long long Query(int S, int X[], int T, int Y[]) { 
    for (int i = 0; i < S; i++)
        update(X[i]);
    ll tot = INF;
    for (int i = 0; i < T; i++)
        tot = min(tot, get(Y[i]));
    for (int i = 0; i < S; i++)
        reset(X[i]); 
    return tot;
}   

// main() {
//     boost;
//     int A[] = {0, 1, 2, 2, 4, 1};
//     int B[] = {1, 2, 3, 4, 5, 6};
//     int D[] = {4, 4, 5, 6, 5, 3};
//     Init(7, A, B, D); 
//     int X[] = {0, 6};
//     int Y[] = {3, 4};
//     cout << Query(2, X, 2, Y) << '\n';
//     return 0;
// }

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 39516 KB Output is correct
2 Correct 216 ms 46908 KB Output is correct
3 Correct 232 ms 47184 KB Output is correct
4 Correct 227 ms 47064 KB Output is correct
5 Correct 237 ms 47444 KB Output is correct
6 Correct 144 ms 47032 KB Output is correct
7 Correct 237 ms 46820 KB Output is correct
8 Correct 229 ms 46800 KB Output is correct
9 Correct 238 ms 46928 KB Output is correct
10 Correct 172 ms 46608 KB Output is correct
11 Correct 231 ms 46812 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 39256 KB Output is correct
2 Correct 1459 ms 152328 KB Output is correct
3 Correct 2175 ms 154056 KB Output is correct
4 Correct 529 ms 152940 KB Output is correct
5 Correct 3641 ms 176388 KB Output is correct
6 Correct 2618 ms 154792 KB Output is correct
7 Correct 642 ms 68640 KB Output is correct
8 Correct 304 ms 70188 KB Output is correct
9 Correct 671 ms 72572 KB Output is correct
10 Correct 670 ms 68980 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 39516 KB Output is correct
2 Correct 216 ms 46908 KB Output is correct
3 Correct 232 ms 47184 KB Output is correct
4 Correct 227 ms 47064 KB Output is correct
5 Correct 237 ms 47444 KB Output is correct
6 Correct 144 ms 47032 KB Output is correct
7 Correct 237 ms 46820 KB Output is correct
8 Correct 229 ms 46800 KB Output is correct
9 Correct 238 ms 46928 KB Output is correct
10 Correct 172 ms 46608 KB Output is correct
11 Correct 231 ms 46812 KB Output is correct
12 Correct 9 ms 39256 KB Output is correct
13 Correct 1459 ms 152328 KB Output is correct
14 Correct 2175 ms 154056 KB Output is correct
15 Correct 529 ms 152940 KB Output is correct
16 Correct 3641 ms 176388 KB Output is correct
17 Correct 2618 ms 154792 KB Output is correct
18 Correct 642 ms 68640 KB Output is correct
19 Correct 304 ms 70188 KB Output is correct
20 Correct 671 ms 72572 KB Output is correct
21 Correct 670 ms 68980 KB Output is correct
22 Correct 1598 ms 154168 KB Output is correct
23 Correct 1832 ms 155576 KB Output is correct
24 Correct 2578 ms 157040 KB Output is correct
25 Correct 2961 ms 157472 KB Output is correct
26 Correct 2839 ms 156984 KB Output is correct
27 Correct 3900 ms 182888 KB Output is correct
28 Correct 640 ms 155956 KB Output is correct
29 Correct 2848 ms 155944 KB Output is correct
30 Correct 2698 ms 156724 KB Output is correct
31 Correct 2687 ms 157040 KB Output is correct
32 Correct 750 ms 73324 KB Output is correct
33 Correct 241 ms 68548 KB Output is correct
34 Correct 500 ms 67668 KB Output is correct
35 Correct 466 ms 67636 KB Output is correct
36 Correct 590 ms 69484 KB Output is correct
37 Correct 654 ms 68048 KB Output is correct