题目大意
给你一颗
N
个节点树,每条边都有有一个距离。每个点都有一个初始权值,为123456789123456789。现在有两种操作:
Ord=2
:给定两个整数
S,T
,表示询问
S
到
N,M≤105
解题思路
很显然这道题目在每个点上只需记录一下最小的权值就可以了。而在树上的情况比较复杂,我们可以先讨论以下在序列上的情况。
对于序列,我们可以把距离抽象成
x
轴坐标,最小权值抽象成
其实我们可以用线段树来维护直线的信息。
对于线段树的每个节点维护一个直线L,假设当前要往区间
对于查询操作,只需沿线段树往下走,把每个区间的L更新一下答案就可以了。
那么对于树上的情况,我们只需要把把树剖分一下,把线段分成几段,再用对序列的维护方法维护一下就可以了。
程序
//YxuanwKeith
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 3e5 + 5;
const LL Inf = 123456789123456789;
struct Node {
int l, r;
Node (int a, int b) {l = a, r = b;}
Node () {}
};
struct Cross {
LL a, b;
Cross(LL x, LL y) {a = x, b = y;}
Cross() {};
};
struct Tree {
LL Min;
bool Flag;
Cross Line;
} Tr[MAXN * 4];
LL Dis[MAXN];
Node L[MAXN], R[MAXN];
int N, M, Bel[MAXN];
int tot, Last[MAXN], Next[MAXN * 2], Go[MAXN * 2], Len[MAXN * 2];
int time, Ord[MAXN], Size[MAXN], MSon[MAXN], Top[MAXN], Pre[MAXN], Deep[MAXN];
void Link(int u, int v, int w) {
Next[++ tot] = Last[u], Last[u] = tot, Go[tot] = v, Len[tot] = w;
}
void Basis(int Now, int Fa, LL len) {
Dis[Now] = Dis[Fa] + len;
Size[Now] = 1, Deep[Now] = Deep[Fa] + 1;
Pre[Now] = Fa;
for (int p = Last[Now]; p; p = Next[p]) {
int v = Go[p];
if (v == Fa) continue;
Basis(v, Now, Len[p]);
Size[Now] += Size[v];
if (Size[v] > Size[MSon[Now]]) MSon[Now] = v;
}
}
void Promote(int Now, int top) {
if (!Now) return;
Top[Now] = top;
Ord[Now] = ++ time;
Bel[time] = Now;
Promote(MSon[Now], top);
for (int p = Last[Now]; p; p = Next[p]) {
int v = Go[p];
if (v == Pre[Now] || v == MSon[Now]) continue;
Promote(v, v);
}
}
void Build(int Now, int l, int r) {
Tr[Now].Min = Inf;
if (l == r) return;
int Mid = (l + r) >> 1;
Build(Now * 2, l, Mid), Build(Now * 2 + 1, Mid + 1, r);
}
void Prepare() {
Basis(1, 0, 0), Promote(1, 1);
Build(1, 1, N);
}
LL Calc(Cross Now, int Side) {
return Now.a * Dis[Bel[Side]] + Now.b;
}
LL GetMin(Cross Now, int l, int r) {
return min(Calc(Now, l), Calc(Now, r));
}
void Update(int Now, int l, int r) {
LL Ans = Inf;
if (Tr[Now].Flag) Ans = GetMin(Tr[Now].Line, l, r);
if (l == r) {
Tr[Now].Min = Ans;
return;
}
Tr[Now].Min = min(Ans, min(Tr[Now * 2].Min, Tr[Now * 2 + 1].Min));
}
void Modify(int Now, int l, int r, int lx, int rx, Cross New) {
if (r < lx || rx < l || l > r) return;
int Mid = (l + r) >> 1;
if (l >= lx && r <= rx) {
if (!Tr[Now].Flag) {
Tr[Now].Line = New;
Tr[Now].Flag = 1;
Update(Now, l, r);
return;
}
Cross Good = Tr[Now].Line, Bad = New;
if (Calc(New, Mid) < Calc(Good, Mid)) swap(Good, Bad);
Tr[Now].Line = Good;
if (l != r) {
if (Calc(Bad, r) < Calc(Good, r)) Modify(Now * 2 + 1, Mid + 1, r, lx, rx, Bad); else
Modify(Now * 2, l, Mid, lx, rx, Bad);
}
Update(Now, l, r);
return;
}
Modify(Now * 2, l, Mid, lx, rx, New), Modify(Now * 2 + 1, Mid + 1, r, lx, rx, New);
Update(Now, l, r);
}
void Modify(int s, int t, LL a, LL b) {
int NumL = 0, NumR = 0, u = s, v = t;
while (Top[u] != Top[v]) {
if (Deep[Top[u]] > Deep[Top[v]]) {
L[++ NumL] = Node(Ord[Top[u]], Ord[u]);
u = Pre[Top[u]];
} else {
R[++ NumR] = Node(Ord[Top[v]], Ord[v]);
v = Pre[Top[v]];
}
}
int top;
if (Deep[u] < Deep[v]) R[++ NumR] = Node(Ord[u], Ord[v]), top = u; else
L[++ NumL] = Node(Ord[v], Ord[u]), top = v;
for (int i = 1; i <= NumL; i ++)
Modify(1, 1, N, L[i].l, L[i].r, Cross(-a, a * Dis[s] + b));
for (int i = NumR; i; i --)
Modify(1, 1, N, R[i].l, R[i].r, Cross(a, a * (Dis[s] - 2 * Dis[top]) + b));
}
LL Query(int Now, int l, int r, int lx, int rx) {
if (r < lx || l > rx) return Inf;
if (l >= lx && r <= rx) return Tr[Now].Min;
int Mid = (l + r) >> 1;
LL Ans = Inf;
if (Tr[Now].Flag) Ans = GetMin(Tr[Now].Line, max(l, lx), min(r, rx));
return min(Ans, min(Query(Now * 2, l, Mid, lx, rx), Query(Now * 2 + 1, Mid + 1, r, lx, rx)));
}
void Query(int u, int v) {
LL Ans = Inf;
while (Top[u] != Top[v]) {
if (Deep[Top[u]] < Deep[Top[v]]) swap(u, v);
Ans = min(Ans, Query(1, 1, N, Ord[Top[u]], Ord[u]));
u = Pre[Top[u]];
}
if (Deep[u] < Deep[v]) swap(u, v);
Ans = min(Ans, Query(1, 1, N, Ord[v], Ord[u]));
printf("%lld\n", Ans);
}
int main() {
scanf("%d%d", &N, &M);
for (int i = 1; i < N; i ++) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
Link(u, v, w), Link(v, u, w);
}
Prepare();
for (int i = 1; i <= M; i ++) {
int Ord, s, t;
scanf("%d%d%d", &Ord, &s, &t);
if (Ord == 1) {
LL a, b;
scanf("%lld%lld", &a, &b);
Modify(s, t, a, b);
} else Query(s, t);
}
}