oj.uz

Submission #843456

# Submission time Handle Problem Language Result Execution time Memory
843456 2023-09-04T02:45:27 Z hotboy2703 Factories (JOI14_factories) C++17
100 / 100
 2131 ms 448044 KB 
#include "factories.h"
#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define pii pair<long long, long long>
#define vi vector<long long>
#define vll vector<ll>
#define vvi vector<vi>
#define vii vector<pii>
#define isz(x) (long long)x.size()
using namespace std;
//5e5
const long long mxN = 5e5 + 5;
const ll oo = 1e18;

long long n;
vector<vii> G;

vi vtn;
//vii -> vll
vector<vector <pair <long long,ll> > > vt;

ll dis[mxN];
//mxN,25
pii sparse[25][mxN * 2];
long long timer, ecnt, ap[mxN], dep[mxN], cur[mxN], tin[mxN], tout[mxN];

void dfs(long long v, long long p) {
    tin[v] = ++timer;
    dep[v] = dep[p] + 1;
    sparse[0][++ecnt] = {dep[v], v};
    ap[v] = ecnt;
    //dis
    for(auto &[u, w] : G[v]) {
        if(u == p) continue;
        dis[u] = dis[v] + w;
        dfs(u, v);
        sparse[0][++ecnt] = {dep[v], v};
    }

    tout[v] = ++timer;
}

void build_sparse() {
    for(long long p = 1, i = 1; p << 1 <= ecnt; p <<= 1, ++i)
        for(long long j = 1; j <= ecnt - (p << 1) + 1; ++j)
            sparse[i][j] = min(sparse[i - 1][j], sparse[i - 1][j + p]);
}

bool is_ancestor(long long u, long long v) {
    return tin[u] <= tin[v] && tout[u] >= tout[v];
}

long long LCA(long long u, long long v) {
    long long l = ap[u], r = ap[v];
    if(l > r) swap(l, r);
    long long len = r - l + 1, lg_len = __lg(len);
    return min(sparse[lg_len][l], sparse[lg_len][r - (1 << lg_len) + 1]).ss;
}

void Init(int N, int A[], int B[], int D[]) {
    n = N;
    G.resize(n); vt.resize(n);
    for(int i = 0; i < N - 1; ++i) {
        G[A[i]].emplace_back(B[i], D[i]);
        G[B[i]].emplace_back(A[i], D[i]);
    }
    dfs(0, 0); build_sparse();
}

long long Query(int S, int X[], int T, int Y[]) {
    queue<pii> q;

    for(long long i = 0; i < S; ++i) {
        cur[X[i]] = 1;
        q.emplace(X[i], 0);
        vtn.emplace_back(X[i]);
    }
    for(long long i = 0; i < T; ++i) {
        cur[Y[i]] = 2;
        vtn.emplace_back(Y[i]);
    }

    sort(all(vtn), [&](long long u, long long v) {
        return tin[u] < tin[v];
    });

    for(long long i = 0; i < S + T - 1; ++i) {
        vtn.emplace_back(LCA(vtn[i], vtn[i + 1]));
    }

    sort(all(vtn), [&](long long u, long long v) {
        return tin[u] < tin[v];
    });
    vtn.erase(unique(all(vtn)), vtn.end());

    auto add_vt = [&](long long u, long long v, long long w) {
        vt[u].emplace_back(v, w);
        vt[v].emplace_back(u, w);
    };

    stack<long long> s;
    for(long long i = 0; i < isz(vtn); ++i) {
        while(not s.empty() && not is_ancestor(s.top(), vtn[i])) s.pop();
        if(s.empty()) s.emplace(vtn[i]);
        else {
            add_vt(s.top(), vtn[i], dis[vtn[i]] - dis[s.top()]);
            s.emplace(vtn[i]);
        }
    }

    ll res = oo;

    auto dfs = [&](auto self, long long v, long long p) -> vll {
        vll cur_dis(2, oo);
        if(cur[v]) cur_dis[cur[v] - 1] = 0;
        //vt, G
        for(auto &[u, w] : vt[v]) {
            if(u == p) continue;
            //cout<<u<<' '<<v<<' '<<w<<' '<<dis[u]<<' '<<dis[v]<<'\n';
            vll tmp = self(self, u, v);
            for(long long i = 0; i < 2; ++i)
                cur_dis[i] = min(cur_dis[i], tmp[i] + w);
        }
        res = min(res, accumulate(all(cur_dis), 0LL));
        return cur_dis;
    };

    dfs(dfs, vtn[0], 0);
    for (auto x:vtn){
        cur[x] = 0;
        vt[x].clear();
    }
    /*for(long long i = 0; i < S; ++i) {
        cur[X[i]] = 0;
        vt[X[i]].clear();
    }
    for(long long i = 0; i < T; ++i) {
        cur[Y[i]] = 0;
        vt[Y[i]].clear();
    }*/
    vtn.clear();

    return res;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 41564 KB Output is correct
2 Correct 557 ms 56988 KB Output is correct
3 Correct 552 ms 57060 KB Output is correct
4 Correct 562 ms 57316 KB Output is correct
5 Correct 515 ms 57308 KB Output is correct
6 Correct 354 ms 56912 KB Output is correct
7 Correct 538 ms 57168 KB Output is correct
8 Correct 560 ms 57048 KB Output is correct
9 Correct 519 ms 57312 KB Output is correct
10 Correct 347 ms 56916 KB Output is correct
11 Correct 547 ms 57060 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 41564 KB Output is correct
2 Correct 932 ms 415320 KB Output is correct
3 Correct 943 ms 419748 KB Output is correct
4 Correct 692 ms 412828 KB Output is correct
5 Correct 919 ms 447784 KB Output is correct
6 Correct 987 ms 420360 KB Output is correct
7 Correct 737 ms 139584 KB Output is correct
8 Correct 506 ms 138528 KB Output is correct
9 Correct 575 ms 143688 KB Output is correct
10 Correct 710 ms 138064 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 41564 KB Output is correct
2 Correct 557 ms 56988 KB Output is correct
3 Correct 552 ms 57060 KB Output is correct
4 Correct 562 ms 57316 KB Output is correct
5 Correct 515 ms 57308 KB Output is correct
6 Correct 354 ms 56912 KB Output is correct
7 Correct 538 ms 57168 KB Output is correct
8 Correct 560 ms 57048 KB Output is correct
9 Correct 519 ms 57312 KB Output is correct
10 Correct 347 ms 56916 KB Output is correct
11 Correct 547 ms 57060 KB Output is correct
12 Correct 6 ms 41564 KB Output is correct
13 Correct 932 ms 415320 KB Output is correct
14 Correct 943 ms 419748 KB Output is correct
15 Correct 692 ms 412828 KB Output is correct
16 Correct 919 ms 447784 KB Output is correct
17 Correct 987 ms 420360 KB Output is correct
18 Correct 737 ms 139584 KB Output is correct
19 Correct 506 ms 138528 KB Output is correct
20 Correct 575 ms 143688 KB Output is correct
21 Correct 710 ms 138064 KB Output is correct
22 Correct 2053 ms 424412 KB Output is correct
23 Correct 1652 ms 423948 KB Output is correct
24 Correct 2131 ms 428652 KB Output is correct
25 Correct 2027 ms 430380 KB Output is correct
26 Correct 1653 ms 422228 KB Output is correct
27 Correct 2094 ms 448044 KB Output is correct
28 Correct 1324 ms 417936 KB Output is correct
29 Correct 1606 ms 421016 KB Output is correct
30 Correct 1587 ms 420768 KB Output is correct
31 Correct 1518 ms 420984 KB Output is correct
32 Correct 963 ms 149792 KB Output is correct
33 Correct 627 ms 143128 KB Output is correct
34 Correct 854 ms 139348 KB Output is correct
35 Correct 822 ms 139276 KB Output is correct
36 Correct 947 ms 139844 KB Output is correct
37 Correct 920 ms 140428 KB Output is correct