oj.uz

Submission #51737

# Submission time Handle Problem Language Result Execution time Memory
51737 2018-06-20T15:59:31 Z SpaimaCarpatilor Factories (JOI14_factories) C++17
100 / 100
 4351 ms 180580 KB 
#include "factories.h"
#include<bits/stdc++.h>

using namespace std;

int nr, rmq[20][1000009], lg[1000009], lev[500009], firstPos[500009], lastPos[500009], color[500009], ap[500009];
long long depth[500009], ans;
const long long INF = 1LL << 59;
vector < pair < int, int > > v[500009];

void dfs (int nod, int tata)
{
    rmq[0][++nr] = nod, firstPos[nod] = nr;
    for (auto it : v[nod])
        if (it.first != tata)
            depth[it.first] = depth[nod] + it.second,
            lev[it.first] = lev[nod] + 1, dfs (it.first, nod),
            rmq[0][++nr] = nod;
    lastPos[nod] = nr;
}

int getHigher (int x, int y)
{
    if (lev[x] > lev[y]) return y;
    return x;
}

int getLCA (int x, int y)
{
    x = firstPos[x], y = firstPos[y];
    if (x > y) swap (x, y);
    int p = lg[y - x + 1];
    return getHigher (rmq[p][x], rmq[p][y - (1 << p) + 1]);
}

bool cmp (int x, int y)
{
    return (firstPos[x] < firstPos[y]);
}

void Init (int N, int A[], int B[], int D[])
{
    for (int i=0; i<N - 1; i++)
    {
        A[i] ++, B[i] ++;
        v[A[i]].push_back ({B[i], D[i]});
        v[B[i]].push_back ({A[i], D[i]});
    }
    dfs (1, -1);
    for (int i=2; i<=nr; i++)
    {
        lg[i] = lg[i - 1];
        if ((2 << lg[i]) <= i)
            lg[i] ++;
    }
    for (int i=1; i<=lg[nr]; i++)
        for (int j=1; j + (1 << i) - 1<=nr; j++)
            rmq[i][j] = getHigher (rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}

bool isAncestor (int up, int down)
{
    return (firstPos[up] <= firstPos[down] && lastPos[down] <= lastPos[up]);
}

vector < int > sons[500009];
pair < long long, long long > solve (int nod)
{
    pair < long long, long long > curr = {INF, INF};
    if (color[nod] == 1) curr.first = depth[nod];
    else
    if (color[nod] == 2) curr.second = depth[nod];
    for (auto it : sons[nod])
    {
        auto currIt = solve (it);
        if (currIt.first < curr.first) curr.first = currIt.first;
        if (currIt.second < curr.second) curr.second = currIt.second;
    }
    if (curr.first + curr.second - 2LL * depth[nod] < ans)
        ans = curr.first + curr.second - 2LL * depth[nod];
    return curr;
}

int stk[500009], h[500009];
long long Query (int S, int X[], int T, int Y[])
{
    nr = 0, ans = INF;
    for (int i=0; i<S; i++)
        X[i] ++, h[++nr] = X[i], color[X[i]] = 1, ap[X[i]] = 1;
    for (int i=0; i<T; i++)
        Y[i] ++, h[++nr] = Y[i], color[Y[i]] = 2, ap[Y[i]] = 1;
    sort (h + 1, h + nr + 1, cmp);
    for (int i=nr - 1; i>=1; i--)
    {
        int curr = getLCA (h[i], h[i + 1]);
        if (ap[curr] == 0)
            ap[curr] = 2, h[++nr] = curr;
    }
    sort (h + 1, h + nr + 1, cmp);
    int l = 0, root = 0;
    for (int i=1; i<=nr; i++)
    {
        while (l > 0 && isAncestor (stk[l], h[i]) == 0) l --;
        if (l == 0) root = h[i];
        else sons[stk[l]].push_back (h[i]);
        stk[++l] = h[i];
    }
    solve (root);
    for (int i=1; i<=nr; i++)
        ap[h[i]] = 0, color[h[i]] = 0,
        sons[h[i]].clear ();
    return ans;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 24440 KB Output is correct
2 Correct 1014 ms 33108 KB Output is correct
3 Correct 980 ms 33248 KB Output is correct
4 Correct 1008 ms 33372 KB Output is correct
5 Correct 885 ms 33372 KB Output is correct
6 Correct 933 ms 33388 KB Output is correct
7 Correct 997 ms 33452 KB Output is correct
8 Correct 979 ms 33452 KB Output is correct
9 Correct 1037 ms 33652 KB Output is correct
10 Correct 791 ms 33652 KB Output is correct
11 Correct 1060 ms 33652 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 33652 KB Output is correct
2 Correct 1938 ms 147504 KB Output is correct
3 Correct 2342 ms 149680 KB Output is correct
4 Correct 1547 ms 149680 KB Output is correct
5 Correct 1991 ms 177668 KB Output is correct
6 Correct 2609 ms 177668 KB Output is correct
7 Correct 1881 ms 177668 KB Output is correct
8 Correct 1041 ms 177668 KB Output is correct
9 Correct 1322 ms 177668 KB Output is correct
10 Correct 2129 ms 177668 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 24440 KB Output is correct
2 Correct 1014 ms 33108 KB Output is correct
3 Correct 980 ms 33248 KB Output is correct
4 Correct 1008 ms 33372 KB Output is correct
5 Correct 885 ms 33372 KB Output is correct
6 Correct 933 ms 33388 KB Output is correct
7 Correct 997 ms 33452 KB Output is correct
8 Correct 979 ms 33452 KB Output is correct
9 Correct 1037 ms 33652 KB Output is correct
10 Correct 791 ms 33652 KB Output is correct
11 Correct 1060 ms 33652 KB Output is correct
12 Correct 24 ms 33652 KB Output is correct
13 Correct 1938 ms 147504 KB Output is correct
14 Correct 2342 ms 149680 KB Output is correct
15 Correct 1547 ms 149680 KB Output is correct
16 Correct 1991 ms 177668 KB Output is correct
17 Correct 2609 ms 177668 KB Output is correct
18 Correct 1881 ms 177668 KB Output is correct
19 Correct 1041 ms 177668 KB Output is correct
20 Correct 1322 ms 177668 KB Output is correct
21 Correct 2129 ms 177668 KB Output is correct
22 Correct 4337 ms 177668 KB Output is correct
23 Correct 3277 ms 177668 KB Output is correct
24 Correct 4351 ms 177668 KB Output is correct
25 Correct 4220 ms 177668 KB Output is correct
26 Correct 4231 ms 177668 KB Output is correct
27 Correct 3669 ms 180580 KB Output is correct
28 Correct 2652 ms 180580 KB Output is correct
29 Correct 3957 ms 180580 KB Output is correct
30 Correct 4051 ms 180580 KB Output is correct
31 Correct 3992 ms 180580 KB Output is correct
32 Correct 1846 ms 180580 KB Output is correct
33 Correct 1341 ms 180580 KB Output is correct
34 Correct 1864 ms 180580 KB Output is correct
35 Correct 1804 ms 180580 KB Output is correct
36 Correct 2070 ms 180580 KB Output is correct
37 Correct 2146 ms 180580 KB Output is correct