#include "factories.h"
#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
// #define int long long
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, ll>
#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 = 5e5 + 5;
const ll oo = 1e18;
int n;
vector<vii> G;
vi vtn;
vector<vii> vt;
ll dis[mxN];
pii sparse[19][mxN];
ll timer, ecnt, ap[mxN], dep[mxN], cur[mxN], tin[mxN], tout[mxN];
void dfs(int v, int p)
{
tin[v] = ++timer;
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 i = 1; (1 << i) <= ecnt; i++)
for (int j = 1; j <= ecnt - (1 << i) + 1; ++j)
sparse[i][j] = min(sparse[i - 1][j], sparse[i - 1][j + (1 << (i - 1))]);
}
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, 0);
build_sparse();
// cout << LCA(4, 6) << ' ' << ap[4] << ' ' << ap[6] << ' ' << sparse[2][8].ss << '\n';
}
long long Query(int S, int X[], int T, int Y[])
{
for (int i = 0; i < S; ++i)
{
cur[X[i]] = 1;
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 ap[u] < ap[v]; });
int sz = vtn.size();
for (int i = 0; i < sz - 1; ++i)
{
vtn.emplace_back(LCA(vtn[i], vtn[i + 1]));
// cout << vtn[i] << ' ' << vtn[i + 1] << ' ' << LCA(vtn[i], vtn[i + 1]) << '\n';
}
sort(all(vtn));
vtn.erase(unique(all(vtn)), vtn.end());
sort(all(vtn), [&](int u, int v)
{ return ap[u] < ap[v]; });
auto add_vt = [&](int u, int v, int 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
{
// cout << s.top() << ' ' << vtn[i] << ' ' << dis[vtn[i]] - dis[s.top()] << '\n';
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, cur_dis[0] + cur_dis[1]);
return cur_dis;
};
dfs(dfs, vtn[0], -1);
for (auto v : vtn)
{
vt[v].clear();
}
for (int i = 0; i < S; ++i)
{
cur[X[i]] = 0;
}
for (int i = 0; i < T; ++i)
{
cur[Y[i]] = 0;
}
vtn.clear();
return res;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
45656 KB |
Output is correct |
| 2 |
Correct |
703 ms |
58968 KB |
Output is correct |
| 3 |
Correct |
707 ms |
58960 KB |
Output is correct |
| 4 |
Incorrect |
695 ms |
59004 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
45656 KB |
Output is correct |
| 2 |
Runtime error |
642 ms |
487848 KB |
Execution killed with signal 11 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
45656 KB |
Output is correct |
| 2 |
Correct |
703 ms |
58968 KB |
Output is correct |
| 3 |
Correct |
707 ms |
58960 KB |
Output is correct |
| 4 |
Incorrect |
695 ms |
59004 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
