oj.uz

Submission #843416

# Submission time Handle Problem Language Result Execution time Memory
843416 2023-09-04T01:48:44 Z huutuan Factories (JOI14_factories) C++17
100 / 100
 2185 ms 296024 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<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vii vector<pii>
#define isz(x) (int)x.size()
using namespace std;
 
const int mxN = 1e6 + 10;
const ll oo = 1e18;
 
int n;
vector<vii> G;
 
vi vtn;
vector<vector<pair<ll, ll>>> vt;
 
ll dis[mxN];
pii sparse[20][mxN];
int timer, ecnt, ap[mxN], dep[mxN], cur[mxN], tin[mxN], tout[mxN];
 
void dfs(int v, int p)
{
   tin[v] = ++timer;
      if (p == -1){
      dep[v] = dis[v] = 0;
   }else dep[v] = dep[p] + 1;
   sparse[0][++ecnt] = {dep[v], v};
   ap[v] = ecnt;

   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 (int p = 1, i = 1; p << 1 <= ecnt; p <<= 1, ++i)
      for (int j = 1; j <= ecnt - (p << 1) + 1; ++j)
         sparse[i][j] = min(sparse[i - 1][j], sparse[i - 1][j + p]);
}
 
bool is_ancestor(int u, int v)
{
   return tin[u] <= tin[v] && tout[u] >= tout[v];
}
 
int LCA(int u, int v)
{
   int l = ap[u], r = ap[v];
   if (l > r)
      swap(l, r);
   int 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, -1);
   build_sparse();
}
 
long long Query(int S, int X[], int T, int Y[])
{
   // queue<pii> q;
 
   for (int i = 0; i < S; ++i)
   {
      cur[X[i]] = 1;
      // q.emplace(X[i], 0);
      vtn.emplace_back(X[i]);
   }
   for (int i = 0; i < T; ++i)
   {
      cur[Y[i]] = 2;
      vtn.emplace_back(Y[i]);
   }
 
   sort(all(vtn), [&](int u, int v)
        { return tin[u] < tin[v]; });
 
   for (int i = 0; i < S + T - 1; ++i)
   {
      vtn.emplace_back(LCA(vtn[i], vtn[i + 1]));
   }
 
   sort(all(vtn), [&](int u, int v)
        { return tin[u] < tin[v]; });
   vtn.erase(unique(all(vtn)), vtn.end());
 
   auto add_vt = [&](int u, int v, ll w)
   {
      vt[u].emplace_back(v, w);
      vt[v].emplace_back(u, w);
   };
 
   stack<int> s;
   for (int 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, int v, int p) -> vll
   {
      vll cur_dis(2, oo);
      if (cur[v])
         cur_dis[cur[v] - 1] = 0;
      for (auto &[u, w] : vt[v])
      {
         if (u == p)
            continue;
         vll tmp = self(self, u, v);
         for (int 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], -1);
 
   // for (int i = 0; i < S; ++i)
   // {
   //    cur[X[i]] = 0;
   //    // vt[X[i]].clear();
   // }
   // for (int i = 0; i < T; ++i)
   // {
   //    cur[Y[i]] = 0;
   //    // vt[Y[i]].clear();
   // }
   for (int i:vtn) vt[i].clear(), cur[i] = 0;
   vtn.clear();

   return res;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47708 KB Output is correct
2 Correct 697 ms 62800 KB Output is correct
3 Correct 618 ms 62684 KB Output is correct
4 Correct 643 ms 62852 KB Output is correct
5 Correct 560 ms 63176 KB Output is correct
6 Correct 372 ms 62760 KB Output is correct
7 Correct 597 ms 62664 KB Output is correct
8 Correct 586 ms 62868 KB Output is correct
9 Correct 589 ms 63312 KB Output is correct
10 Correct 390 ms 62664 KB Output is correct
11 Correct 577 ms 62820 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47704 KB Output is correct
2 Correct 942 ms 258916 KB Output is correct
3 Correct 1065 ms 263748 KB Output is correct
4 Correct 763 ms 257828 KB Output is correct
5 Correct 965 ms 296024 KB Output is correct
6 Correct 1022 ms 264376 KB Output is correct
7 Correct 767 ms 115692 KB Output is correct
8 Correct 642 ms 114792 KB Output is correct
9 Correct 568 ms 119920 KB Output is correct
10 Correct 702 ms 116260 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47708 KB Output is correct
2 Correct 697 ms 62800 KB Output is correct
3 Correct 618 ms 62684 KB Output is correct
4 Correct 643 ms 62852 KB Output is correct
5 Correct 560 ms 63176 KB Output is correct
6 Correct 372 ms 62760 KB Output is correct
7 Correct 597 ms 62664 KB Output is correct
8 Correct 586 ms 62868 KB Output is correct
9 Correct 589 ms 63312 KB Output is correct
10 Correct 390 ms 62664 KB Output is correct
11 Correct 577 ms 62820 KB Output is correct
12 Correct 7 ms 47704 KB Output is correct
13 Correct 942 ms 258916 KB Output is correct
14 Correct 1065 ms 263748 KB Output is correct
15 Correct 763 ms 257828 KB Output is correct
16 Correct 965 ms 296024 KB Output is correct
17 Correct 1022 ms 264376 KB Output is correct
18 Correct 767 ms 115692 KB Output is correct
19 Correct 642 ms 114792 KB Output is correct
20 Correct 568 ms 119920 KB Output is correct
21 Correct 702 ms 116260 KB Output is correct
22 Correct 1991 ms 266660 KB Output is correct
23 Correct 1815 ms 266836 KB Output is correct
24 Correct 2112 ms 271028 KB Output is correct
25 Correct 2185 ms 272632 KB Output is correct
26 Correct 1665 ms 266412 KB Output is correct
27 Correct 1902 ms 292872 KB Output is correct
28 Correct 1289 ms 263232 KB Output is correct
29 Correct 1596 ms 265236 KB Output is correct
30 Correct 1612 ms 264444 KB Output is correct
31 Correct 1567 ms 264848 KB Output is correct
32 Correct 925 ms 123980 KB Output is correct
33 Correct 640 ms 116872 KB Output is correct
34 Correct 878 ms 115600 KB Output is correct
35 Correct 863 ms 115412 KB Output is correct
36 Correct 931 ms 116168 KB Output is correct
37 Correct 934 ms 116048 KB Output is correct