oj.uz

Submission #683313

# Submission time Handle Problem Language Result Execution time Memory
683313 2023-01-18T07:23:31 Z whqkrtk04 Factories (JOI14_factories) C++17
100 / 100
 5866 ms 154592 KB 
#include "factories.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
#define fi first
#define se second
const int INF = 1e9+1;
const ll LLINF = (ll)1e18+1;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) { for(auto i : v) os << i << " "; os << "\n"; return os; }
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) { os << p.fi << " " << p.se; return os; }

vector<vector<int>> S, E;
vector<int> P, L, I, O;
vector<ll> D;
vector<bool> U, V;

int lca(int x, int y) {
    if(L[x] < L[y]) swap(x, y);
    for(int i = 19; i >= 0; i--)
        if(L[S[x][i]] >= L[y])
            x = S[x][i];
    if(x == y) return x;
    for(int i = 19; i >= 0; i--)
        if(S[x][i] != S[y][i])
            x = S[x][i], y = S[y][i];
    return S[x][0];
}

void make_sparse() {
    S.resize(P.size(), vector<int>(20));
    for(int i = 0; i < P.size(); i++) S[i][0] = P[i];
    for(int i = 0; i < P.size(); i++)
        for(int j = 1; j < 20; j++)
            S[i][j] = S[S[i][j-1]][j-1];
}

void dfs(int x, int p, int &cnt, vector<vector<pii>> &E) {
    I[x] = cnt++;
    for(auto &i : E[x]) {
        if(i.fi == p) continue;
        L[cnt] = L[I[x]]+1;
        D[cnt] = D[I[x]]+i.se;
        P[cnt] = I[x];
        dfs(i.fi, x, cnt, E);
    }
    O[x] = cnt;
}

plll solve(int x) {
    plll ans = {LLINF, {LLINF, LLINF}};
    if(U[x]) ans.se.fi = 0LL;
    if(V[x]) ans.se.se = 0LL;
    U[x] = V[x] = false;
    for(auto i : E[x]) {
        plll tmp = solve(i);
        ans.fi = min(ans.fi, tmp.fi);
        ans.se.fi = min(ans.se.fi, tmp.se.fi + D[i] - D[x]);
        ans.se.se = min(ans.se.se, tmp.se.se + D[i] - D[x]);
    }
    ans.fi = min(ans.fi, ans.se.fi+ans.se.se);
    return ans;
}

void sort_vertex(vector<int> &vertex) {
    sort(vertex.begin(), vertex.end());
    vertex.erase(unique(vertex.begin(), vertex.end()), vertex.end());
}

void make_tree(vector<int> &M) {
    int tmpsize = M.size();
    for(int i = 1; i < tmpsize; i++) M.push_back(lca(M[i-1], M[i]));
    sort_vertex(M);
    for(int i = 1; i < M.size(); i++) E[lca(M[i-1], M[i])].push_back(M[i]);
}

void Init(int N, int A[], int B[], int X[]) {
    vector<vector<pii>> T(N);
    for(int i = 0; i < N-1; i++) {
        T[A[i]].push_back({B[i], X[i]});
        T[B[i]].push_back({A[i], X[i]});
    }
    I.resize(N); O.resize(N); P.resize(N);
    D.resize(N, 0LL); L.resize(N, 0);
    int cnt = 0;
    dfs(0, 0, cnt, T);
    make_sparse();
    U.resize(N, false); V.resize(N, false); E.resize(N);
}

ll Query(int S, int X[], int T, int Y[]) {
    //cout << "query " << S << " " << T << "\n";
    vector<int> XX(X, X+S), YY(Y, Y+T), M;
    for(auto i : XX) { M.push_back(I[i]); U[I[i]] = true; }
    for(auto i : YY) { M.push_back(I[i]); V[I[i]] = true; }
    sort_vertex(M);
    make_tree(M);
    plll ans = solve(M[0]);
    assert(ans.se.fi < LLINF && ans.se.se < LLINF);
    for(auto i : M) E[i].clear();
    return ans.fi;
}

Compilation message

factories.cpp: In function 'void make_sparse()':
factories.cpp:37:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int i = 0; i < P.size(); i++) S[i][0] = P[i];
      |                    ~~^~~~~~~~~~
factories.cpp:38:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i = 0; i < P.size(); i++)
      |                    ~~^~~~~~~~~~
factories.cpp: In function 'void make_tree(std::vector<int>&)':
factories.cpp:79:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for(int i = 1; i < M.size(); i++) E[lca(M[i-1], M[i])].push_back(M[i]);
      |                    ~~^~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 596 KB Output is correct
2 Correct 1238 ms 9408 KB Output is correct
3 Correct 1436 ms 9560 KB Output is correct
4 Correct 1267 ms 9588 KB Output is correct
5 Correct 1033 ms 9844 KB Output is correct
6 Correct 1070 ms 9424 KB Output is correct
7 Correct 1417 ms 9476 KB Output is correct
8 Correct 1272 ms 9484 KB Output is correct
9 Correct 1029 ms 9724 KB Output is correct
10 Correct 986 ms 9440 KB Output is correct
11 Correct 1400 ms 9576 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 468 KB Output is correct
2 Correct 2085 ms 124060 KB Output is correct
3 Correct 3565 ms 127328 KB Output is correct
4 Correct 1432 ms 124800 KB Output is correct
5 Correct 3297 ms 154592 KB Output is correct
6 Correct 3828 ms 127592 KB Output is correct
7 Correct 3076 ms 32988 KB Output is correct
8 Correct 1432 ms 32840 KB Output is correct
9 Correct 2687 ms 36040 KB Output is correct
10 Correct 2952 ms 33268 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 596 KB Output is correct
2 Correct 1238 ms 9408 KB Output is correct
3 Correct 1436 ms 9560 KB Output is correct
4 Correct 1267 ms 9588 KB Output is correct
5 Correct 1033 ms 9844 KB Output is correct
6 Correct 1070 ms 9424 KB Output is correct
7 Correct 1417 ms 9476 KB Output is correct
8 Correct 1272 ms 9484 KB Output is correct
9 Correct 1029 ms 9724 KB Output is correct
10 Correct 986 ms 9440 KB Output is correct
11 Correct 1400 ms 9576 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 2085 ms 124060 KB Output is correct
14 Correct 3565 ms 127328 KB Output is correct
15 Correct 1432 ms 124800 KB Output is correct
16 Correct 3297 ms 154592 KB Output is correct
17 Correct 3828 ms 127592 KB Output is correct
18 Correct 3076 ms 32988 KB Output is correct
19 Correct 1432 ms 32840 KB Output is correct
20 Correct 2687 ms 36040 KB Output is correct
21 Correct 2952 ms 33268 KB Output is correct
22 Correct 2914 ms 126888 KB Output is correct
23 Correct 3101 ms 127620 KB Output is correct
24 Correct 3032 ms 129544 KB Output is correct
25 Correct 3762 ms 131124 KB Output is correct
26 Correct 5539 ms 130088 KB Output is correct
27 Correct 3296 ms 151012 KB Output is correct
28 Correct 1939 ms 128412 KB Output is correct
29 Correct 5866 ms 129716 KB Output is correct
30 Correct 5728 ms 129000 KB Output is correct
31 Correct 5583 ms 129688 KB Output is correct
32 Correct 1649 ms 40468 KB Output is correct
33 Correct 1248 ms 32808 KB Output is correct
34 Correct 2198 ms 31864 KB Output is correct
35 Correct 2122 ms 31820 KB Output is correct
36 Correct 2764 ms 32516 KB Output is correct
37 Correct 2705 ms 32548 KB Output is correct