#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define el "\n"
#define f first
#define s second
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
typedef long long ll;
const ll MM=5e5+5, MOD=1e9+7;
int top[MM], dep[MM], fa[MM], son[MM], sz[MM], nxt[MM]; ll dst[MM], spc[MM];
vector<pair<int,int>> adj[MM];
bool blk[MM];
void df1(int u, int pa) {
sz[u]=1; fa[u]=pa; dep[u]=dep[pa]+1;
for(pair<int,int> &e:adj[u]) {
int v=e.f, w=e.s; if(v==pa) continue;
dst[v]=dst[u]+w; df1(v, u); sz[u]+=sz[v];
if(sz[v]>sz[son[u]]) son[u]=v; } }
void df2(int u, int pa) {
if(son[u]) {
top[son[u]]=top[u]; df2(son[u], u); }
for(pair<int,int> &e:adj[u]) {
int v=e.f; if(v==pa||v==son[u]) continue;
df2(top[v]=v, u); } }
inline int lca(int u, int v) {
for(; top[u]!=top[v]; u=fa[top[u]]) {
if(dep[top[u]]<dep[top[v]]) swap(u, v); }
return dep[u]<dep[v]?u:v; }
void gsz(int u, int pa) {
sz[u]=1;
for(pair<int,int> &e:adj[u]) {
int v=e.f; if(blk[v]||v==pa) continue;
gsz(v, u); sz[u]+=sz[v]; } }
int ctr(int u, int pa, int nd) {
for(pair<int,int> &e:adj[u]) {
int v=e.f; if(blk[v]||v==pa) continue;
if(sz[v]*2>nd) return ctr(v, u, nd); }
return u; }
inline ll dist(int u, int v) {
return dst[u]+dst[v]-2LL*dst[lca(u, v)]; }
void slv(int u, int pa) {
gsz(u, -1); u=ctr(u, -1, sz[u]); blk[u]=1; nxt[u]=pa;
for(pair<int,int> &e:adj[u]) {
int v=e.f; if(!blk[v]) slv(v, u); } }
void Init(int N, int A[], int B[], int D[]) {
for(int i=0; i<N; ++i) spc[i]=1e18;
for(int i=1; i<N; ++i) {
adj[A[i]].emplace_back(B[i], D[i]); adj[B[i]].emplace_back(A[i], D[i]); }
df1(0, 0); df2(top[0]=0, 0); slv(0, -1); }
long long Query(int S, int X[], int T, int Y[]) {
for(int i=0, c; i<S; ++i) {
c=X[i];
while(c!=-1)
spc[c]=min(spc[c], dist(X[i], c)), c=nxt[c], assert(c!=nxt[c]); }
long long ans=1e18;
for(int i=0, c; i<T; ++i) {
c=Y[i];
while(c!=-1)
ans=min(ans, dist(Y[i], c)+spc[c]), c=nxt[c], assert(c!=nxt[c]); }
for(int i=0, c; i<S; ++i) {
c=X[i];
while(c!=-1)
spc[c]=1e18, c=nxt[c], assert(c!=nxt[c]); }
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
12364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
9 ms |
12220 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
12364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
