洛谷 P3979 遥远的国度
题意
有一棵 n n n 个城市组成的树,每个城市有一个防御值,根节点的编号是 r r r ,有 m m m 次操作:
- o p = 1 op=1 op=1 ,把首都修改为 i d id id 。
- o p = 2 op=2 op=2 ,把 x x x 到 y y y 路径上的所有防御值修改为 v v v 。
- o p = 3 op=3 op=3 ,询问以 x x x 为根的子树的最小防御值。
解法
裸的换根树链剖分。
- 对于路径上的修改是和根无关的。根的修改只影响子树。
- 树链剖分支持换根,一开始以
1
1
1 为根建树。
- 如果 l c a ( n o w , r o o t ) ! = n o w lca(now,root)!=now lca(now,root)!=now 则以 r o o t root root 为根时, n o w now now 的子树不变。
- 如果 n o w = = r o o t now==root now==root ,则 n o w now now 的子树就是整棵树。
- 如果 l c a ( n o w , r o o t ) = n o w lca(now,root)=now lca(now,root)=now ,寻找 n o w − > r o o t now->root now−>root 路径上的第一个点 u u u (倍增或暴力Lca),询问 u u u 子树的补集,在线段树上把 u u u 子树的区间抠出来即可(两次询问)。
代码
#pragma region
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define IT set<node>::iterator
#define tr t[root]
#define lson t[root << 1]
#define rson t[root << 1 | 1]
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, a, n) for (int i = n; i >= a; --i)
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
//fread->R
bool IOerror = 0;
//inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, BUF_SIZE, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch) { return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t'; }
template <class T>
inline bool R(T &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (sign)
x = -x;
return true;
}
inline bool R(double &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (ch == '.') {
double tmp = 1;
ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
tmp /= 10.0, x += tmp * (ch - '0');
}
if (sign)
x = -x;
return true;
}
inline bool R(char *s) {
char ch = nc();
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
for (; !blank(ch) && !IOerror; ch = nc())
*s++ = ch;
*s = 0;
return true;
}
inline bool R(char &c) {
c = nc();
if (IOerror) {
c = -1;
return false;
}
return true;
}
template <class T, class... U>
bool R(T &h, U &... tmp) { return R(h) && R(tmp...); }
#undef OUT_SIZE
#undef BUF_SIZE
}; // namespace fastIO
using namespace fastIO;
template <class T>
void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U>
void _W(const pair<T, U> &x) { _W(x.F), putchar(' '), _W(x.S); }
template <class T>
void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &... tail) { _W(head), putchar(sizeof...(tail) ? ' ' : '\n'), W(tail...); }
#pragma endregion
const int maxn = 1e5 + 5;
int n, m, r;
ll a[maxn];
vector<int> g[maxn];
int son[maxn], fa[maxn], sz[maxn], dep[maxn];
int id[maxn], idd[maxn], cnt, top[maxn];
void dfs1(int u, int f, int deep) {
fa[u] = f, sz[u] = 1, dep[u] = deep;
for (auto v : g[u]) {
if (v == f) continue;
dfs1(v, u, deep + 1);
sz[u] += sz[v];
if (sz[v] > sz[son[u]]) son[u] = v;
}
}
void dfs2(int u, int topf) {
id[u] = ++cnt, idd[cnt] = u, top[u] = topf;
if (!son[u]) return;
dfs2(son[u], topf);
for (auto v : g[u]) {
if (v == son[u] || v == fa[u]) continue;
dfs2(v, v);
}
}
int Lca(int u, int v) {
while (top[u] != top[v]) {
if (dep[top[u]] < dep[top[v]]) swap(u, v);
u = fa[top[u]];
}
return dep[u] < dep[v] ? u : v;
}
struct segtree {
int l, r;
ll minn, tag;
} t[maxn << 2];
void build(int root, int l, int r) {
tr.l = l, tr.r = r, tr.tag = 0;
if (l == r) {
tr.minn = a[idd[l]];
return;
}
int mid = (l + r) >> 1;
build(root << 1, l, mid);
build(root << 1 | 1, mid + 1, r);
tr.minn = min(lson.minn, rson.minn);
}
void spread(int root) {
if (tr.tag) {
lson.minn = tr.tag;
rson.minn = tr.tag;
lson.tag = rson.tag = tr.tag;
tr.tag = 0;
}
}
void update(int root, int l, int r, ll x) {
if (l <= tr.l && tr.r <= r) {
tr.minn = tr.tag = x;
return;
}
spread(root);
int mid = (tr.l + tr.r) >> 1;
if (l <= mid) update(root << 1, l, r, x);
if (r > mid) update(root << 1 | 1, l, r, x);
tr.minn = min(lson.minn, rson.minn);
}
ll query(int root, int l, int r) {
if (l <= tr.l && tr.r <= r) return tr.minn;
spread(root);
ll ans = 1e18;
int mid = (tr.l + tr.r) >> 1;
if (l <= mid) ans = min(ans, query(root << 1, l, r));
if (r > mid) ans = min(ans, query(root << 1 | 1, l, r));
return ans;
}
void updRange(int u, int v, int z) {
while (top[u] != top[v]) {
if (dep[top[u]] < dep[top[v]]) swap(u, v);
update(1, id[top[u]], id[u], z);
u = fa[top[u]];
}
if (dep[u] > dep[v]) swap(u, v);
update(1, id[u], id[v], z);
}
ll qSon(int x) {
int lca = Lca(x, r);
if (lca != x) return query(1, id[x], id[x] + sz[x] - 1);
if (x == r) return query(1, 1, n);
int u;
for (auto v : g[x])
if (Lca(v, r) == v) u = v;
return min(query(1, 1, id[u]-1), query(1, id[u] + sz[u], n));
}
int main() {
R(n, m);
rep(i, 1, n - 1) {
int u, v;
R(u, v);
g[u].push_back(v);
g[v].push_back(u);
}
rep(i, 1, n) R(a[i]);
dfs1(1, 0, 1);
dfs2(1, 1);
R(r);
build(1, 1, n);
while (m--) {
int op, x, y, z;
R(op);
if (op == 1)
R(r);
else if (op == 2) {
R(x, y, z);
updRange(x, y, z);
} else if (op == 3) {
R(x);
W(qSon(x));
}
}
}