- 题目链接:https://www.luogu.com.cn/problem/P3302
- 启发式主席树合并基础题目,和启发式并查集方法保持一致,按秩合并即可,该主席树维护的是根节点到树上任意节点的内容,和 count on tree这个题目维护的内容一样,只是在这个题目的基础上加上了启发式合并
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
#define sz(a) (int)a.size()
#define pii pair <int,int>
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
const int N = 7e5 + 5;
int T, n , m , Q, len;
int a[N], b[N], fa[N], son[N], vis[N];
int bz[N][25], dep[N];
vector <int> edge[N];
int tot , lc[N*50] , rc[N*50], siz[N*50], rt[N*50];
int findroot (int x)
{
if (fa[x] == x)
return x;
return fa[x] = findroot (fa[x]);
}
void build(int& rt, int l , int r)
{
rt = ++ tot;
if(l == r)
return ;
int mid = (l+r) >> 1;
build(lc[rt], l , mid);
build(rc[rt],mid+1,r);
}
int update(int pre , int l , int r , int k)
{
int now = ++ tot;
lc[now] = lc[pre] , rc[now] = rc[pre] , siz[now] = siz[pre] + 1;
if(l == r) return now;
int mid = (l + r) >> 1;
if (k <= mid)
lc[now] = update(lc[now] , l, mid, k);
else
rc[now] = update(rc[now] , mid + 1, r , k);
return now;
}
int query(int rt1, int rt2, int rt3 ,int rt4, int l , int r, int k)
{
int mid = (l + r) >> 1;
int x = siz[lc[rt1]] + siz[lc[rt2]] - siz[lc[rt3]] - siz[lc[rt4]];
if(l == r) return l;
if(x >= k)
return query(lc[rt1], lc[rt2], lc[rt3] , lc[rt4] , l , mid , k);
else
return query(rc[rt1], rc[rt2], rc[rt3] , rc[rt4] , mid + 1 , r , k - x);
}
void dfs (int u, int pa, int root)
{
bz[u][0] = pa;
for (int i = 1 ; i <= 20 ; i ++)
bz[u][i] = bz[bz[u][i-1]][i-1];
son[root] ++;
dep[u] = dep[pa] + 1;
vis[u] = 1;
rt[u] = update (rt[pa], 1, len , lower_bound(b+1,b+1+len,a[u])-b);
for (auto v : edge[u])
{
if (v != pa)
dfs (v, u, root);
}
}
int LCA(int x,int y)
{
if(dep[x] < dep[y])
swap(x,y);
int t = dep[x] - dep[y];
for(int i = 0; (1<<i) <= t ; i ++)
if((1<<i)&t)x=bz[x][i];
for(int i=20 ; i >= 0 ; i--)
if(bz[x][i] ^ bz[y][i])
x=bz[x][i], y=bz[y][i];
if(x==y) return x;
return bz[x][0];
}
int main ()
{
read (T);
T = 1;
while (T --)
{
tot = 0;
mem (dep, 0), mem(vis,0), mem(bz,0), mem(son,0);
int last = 0;
read (n , m, Q);
for (int i = 1 ; i <= n ; i ++)
edge[i].clear();
for (int i = 1 ; i <= n ; i ++)
read (a[i]) , b[i] = a[i], fa[i] = i;
sort (b + 1, b + 1 + n);
len = unique (b + 1, b + 1 + n) - b - 1;
build (rt[0], 1, len);
for (int i = 1 ; i <= m ; i ++)
{
int u , v;
read (u, v);
edge[u].pb(v), edge[v].pb(u);
}
for (int i = 1 ; i <= n ; i ++)
{
if (!vis[i])
{
dfs (i, 0 , i);
fa[i] = i;
}
}
while (Q --)
{
char op[2];
scanf ("%s",op);
int u , v, k;
if(op[0] == 'Q')
{
read (u, v, k);
u ^= last;
v ^= last;
k ^= last;
int lca = LCA(u, v);
int f_lca = bz[lca][0];
int ans = b[query(rt[u], rt[v], rt[lca], rt[f_lca] ,1, len, k)];
write (ans), LF;
last = ans;
}
else
{
read(u, v);
u ^= last;
v ^= last;
edge[u].pb(v);
edge[v].pb(u);
int fax = findroot(u);
int fay = findroot(v);
if (son[fax] < son[fay])
swap(u, v), swap(fax, fay);
dfs(v, u, fax);
}
}
}
}
- 题目链接:https://www.luogu.com.cn/problem/P4197
- 克鲁斯卡尔重构树经典题目 ,本题两个难点,一个是处理出在对应边权限制下快速处理出所有能到达的点,这个地方使用克鲁斯卡尔重构树就可以解决,还有一个问题就是如何快速查询出子树中的第k大的点,这个地方用主席树搞一搞就好了(注意:这里是对重构树按dfs序建立主席树,中间会产生很多无用点,跳过就好了)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
#define sz(a) (int)a.size()
#define pii pair <int,int>
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
const int N = 5e5 + 5;
int n , m , q, tot, len;
int a[N], b[N], fa[N], val[N*2];
struct node {
int u , v, w;
bool operator < (const node& no) const {
return w < no.w;
}
}E[N];
vector <int> edge[N];
int dfn[N] , times;
int ntot , lc[N*50] , rc[N*50], siz[N*50], rt[N*50];
int psiz[N];
int findroot (int x)
{
if (fa[x] == x) return fa[x];
return fa[x] = findroot (fa[x]);
}
bool merge (int x, int y, int w)
{
int fax = findroot (x);
int fay = findroot (y);
if (fax != fay)
{
++ ntot;
val[ntot] = w;
edge[ntot].pb(fax), edge[ntot].pb(fay),edge[fax].pb(ntot),edge[fay].pb(ntot);
fa[fax] = fa[fay] = fa[ntot] = ntot;
return true;
}
return false;
}
void build(int& rt, int l , int r)
{
rt = ++ tot;
if(l == r) return ;
int mid = (l+r) >> 1;
build(lc[rt], l , mid);
build(rc[rt],mid+1,r);
}
int update(int pre , int l , int r , int k)
{
int now = ++ tot;
lc[now] = lc[pre] , rc[now] = rc[pre];
if (k != 0) siz[now] = siz[pre] + 1;
else siz[now] = siz[pre];
if(l == r) return now;
int mid = (l + r) >> 1;
if (k <= mid)
lc[now] = update(lc[now] , l, mid, k);
else
rc[now] = update(rc[now] , mid + 1, r , k);
return now;
}
int query(int u , int v, int l , int r, int k)
{
int mid = (l + r) >> 1, x = siz[lc[v]] - siz[lc[u]];
if(l == r) return l;
if(x >= k)
return query(lc[u],lc[v],l,mid,k);
else
return query(rc[u],rc[v],mid+1,r,k-x);
}
int bz[N][25], dep[N];
void dfs (int u , int pa)
{
psiz[u] = 1;
dfn[u] = ++ times;
if (a[u] != 0)
rt[times] = update(rt[times - 1], 1, len, lower_bound(b + 1, b + 1 + len, a[u]) - b);
else
rt[times] = update(rt[times-1], 1, len, 0);
for (auto v : edge[u])
{
if (v != pa)
{
dep[v] = dep[u] + 1;
bz[v][0] = u;
dfs (v, u);
psiz[u] += psiz[v];
}
}
}
void deal()
{
for(int i = 1 ; i <= 20 ; i ++)
for(int j = 1 ; j <= ntot ; j ++)
bz[j][i] = bz[bz[j][i-1]][i-1];
}
int main ()
{
read (n, m , q);
ntot = n;
for (int i = 1 ; i <= n ; i ++)
read (a[i]), b[i] = a[i], fa[i] = i;
sort (b + 1 , b + 1 + n);
len = unique (b + 1, b + 1 + n) - b - 1;
for (int i = 1 ; i <= m ; i ++)
read (E[i].u,E[i].v,E[i].w);
sort (E+1,E+1+m);
for (int i = 1 ; i <= m ; i ++)
merge (E[i].u , E[i].v, E[i].w);
build (rt[0], 1, len);
dfs (ntot, 0);
deal();
while (q --)
{
int v , x, k;
read (v, x, k);
int u = v;
for (int i = 20 ; i >= 0 ; i --)
{
if (val[bz[u][i]] <= x && bz[u][i] != 0)
u = bz[u][i];
}
int pp = siz[rt[dfn[u]+psiz[u]-1]] - siz[rt[dfn[u]]];
if (siz[rt[dfn[u]+psiz[u]-1]] - siz[rt[dfn[u]]] >= k) {
write(b[query(rt[dfn[u]], rt[dfn[u] + psiz[u] - 1], 1, len, pp - k + 1)]), LF;
}
else
write(-1),LF;
}
}
- 题目链接:https://www.luogu.com.cn/problem/P4768
- 解题思路:一般看到有限制条件的需要快速判断一个点能够到达哪些点,并且答案和这些点相关的,都可以考虑重构树之后解决。
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
#define sz(a) (int)a.size()
#define pii pair <int,int>
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
const int N = 6e5 + 5;
int T;
int n , m;
int Q, k, s;
int head[N] , cnt;
struct node1 {
int u , v , w, x;
bool operator < (const node1& no) const {
return x > no.x;
}
}E[N];
struct node2 {
int t, next, w;
}edge[N << 1];
void add (int f, int t, int w)
{
edge[cnt].t = t;
edge[cnt].w = w;
edge[cnt].next = head[f];
head[f] = cnt ++;
}
ll dis[N], dp[N];
struct node
{
int v;
ll value;
node(int a, ll b):v(a),value(b){};
bool operator < (const node& no) const {
return value > no.value;
}
};
void dijkstra(int s)
{
mem(dis,INF);
p_queue <node> q;
dis[s] = 0;
q.push(node(s,0));
while(!q.empty())
{
node no = q.top();
q.pop();
int u = no.v;
for(int i = head[u] ; i != -1 ; i = edge[i].next)
{
int v = edge[i].t , w = edge[i].w;
if(dis[v] > dis[u] + w)
{
dis[v] = dis[u] + w;
q.push(node(v,dis[v]));
}
}
}
}
int ntot, fa[N], val[N], bz[N][25];
vector <int> Edge[N];
int findroot (int x)
{
if (fa[x] == x) return x;
return fa[x] = findroot (fa[x]);
}
void merge (int x, int y, int w)
{
int fax = findroot (x);
int fay = findroot (y);
if (fax != fay)
{
++ ntot;
val[ntot] = w;
Edge[ntot].pb(fax), Edge[fax].pb(ntot);
Edge[ntot].pb(fay), Edge[fay].pb(ntot);
fa[fax] = fa[fay] = fa[ntot] = ntot;
}
}
void dfs (int u, int pa)
{
for (auto v : Edge[u])
{
if (v != pa)
{
bz[v][0] = u;
dfs (v, u);
dp[u] = min (dp[v], dp[u]);
}
}
}
void deal ()
{
for (int i = 1 ; i <= 20 ; i ++)
for (int j = 1 ; j <= ntot ; j ++)
bz[j][i] = bz[bz[j][i-1]][i-1];
}
int main ()
{
read (T);
while (T --)
{
mem (bz,0);
mem (val ,-1);
mem (dp, INF);
mem (dis, INF);
mem (head, -1), cnt = 0;
read (n, m);
for (int i = 1 ; i <= n ; i ++) fa[i] = i;
ntot = n;
for (int i = 1 ; i <= m ; i ++)
{
read (E[i].u, E[i].v, E[i].w, E[i].x);
add (E[i].u, E[i].v, E[i].w);
add (E[i].v, E[i].u, E[i].w);
}
dijkstra (1);
for (int i = 1 ; i <= ntot ; i ++)
dp[i] = dis[i];
sort (E + 1, E + 1 + m);
for (int i = 1 ; i <= m ; i ++)
{
int u = E[i].u, v = E[i].v, x = E[i].x;
merge (u, v, x);
}
dfs (ntot, 0);
deal ();
read (Q, k ,s);
ll last = 0;
while (Q --)
{
ll u , x;
read (u, x);
if (k == 1)
{
u = ((u + k * last - 1) % n) +1;
x = (x + k * last) % (s + 1);
}
for (int j = 20 ; j >= 0 ; j --)
{
if (val[bz[u][j]] > x)
u = bz[u][j];
}
write (dp[u]), LF;
last = dp[u];
}
for (int i = 1 ; i <= ntot ; i ++)
Edge[i].clear();
}
}
- 题目链接:https://codeforces.com/problemset/problem/1416/D
- 解题思路:首先这个题目删边不好搞,我们可以考虑时光倒流,删边边加边,如果这个题目没有把最大的节点变成0这个条件的话,那么只需要随便搞一下就好了,但是,问题就是这个题有变0操作,并且和操作顺序相关。怎么解决?
这里我们构建一颗克鲁斯卡尔重构树,对于一般的克鲁斯卡尔重构树,新增节点存的都是边权,这里我们把操作的序号作为时间构建,那么这样的话,我们就可以快速查找出满足这个时间轴下从v出发的最大节点了(克鲁斯卡尔重构树本身就可以快速找出所有从v出发的点,这里我们将时间作为点权后,又可以同时保证时间性)。我们利用线段树维护一下子树,每次查询后修改一下子树节点内容即可
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
#define sz(a) (int)a.size()
#define pii pair <int,int>
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
const int N = 1e6 + 5;
int n , m, q;
int a[N], fa[N], ntot, val[N];
struct node1 {
int u , v;
}E[N];
struct node2 {
int op, x;
}Q[N];
vector <int> edge[N];
int vis[N];
int findroot (int x)
{
if (fa[x] == x) return fa[x];
return fa[x] = findroot (fa[x]);
}
void merge (int x, int y, int w)
{
int fax = findroot (x);
int fay = findroot (y);
if (fax != fay)
{
++ntot;
val[ntot] = w;
edge[ntot].pb(fax), edge[fax].pb(ntot);
edge[ntot].pb(fay), edge[fay].pb(ntot);
fa[fax] = fa[fay] = fa[ntot] = ntot;
}
}
int dfn[N], times, bz[N][25], siz[N], ver[N];
void dfs (int u , int pa)
{
siz[u] = 1;
dfn[u] = ++ times;
ver[times] = u;
for (auto v : edge[u])
{
if (v != pa)
{
bz[v][0] = u;
dfs(v, u);
siz[u] += siz[v];
}
}
}
void deal ()
{
for (int i = 1 ; i <= 20 ; i ++)
for (int j = 1 ; j <= ntot ; j ++)
bz[j][i] = bz[bz[j][i-1]][i-1];
}
pii p[N*4];
void insert (int i , int l , int r, int id, int x)
{
if (l == r)
{
p[i].fi = x;
p[i].se = id;
return ;
}
int mid = (l + r) >> 1;
if (id <= mid)
insert (i << 1 , l , mid , id, x);
else
insert (i << 1 | 1 , mid + 1, r , id, x);
p[i] = max(p[i<<1],p[i<<1|1]);
return ;
}
pii query (int i , int L, int R, int l , int r)
{
pii ans;
ans.fi = 0 , ans.se = 0;
if (L >= l && R <= r)
return p[i];
int mid = (L + R) / 2;
if (l <= mid)
ans = max (ans, query(i<<1,L,mid,l,r));
if (mid < r)
ans = max (ans,query(i<<1|1,mid+1,R,l,r));
return ans;
}
int main ()
{
read (n, m , q);
ntot = n;
for (int i = 1 ; i <= n ; i ++)
read (a[i]), fa[i] = i;
for (int i = 1 ; i <= m ; i ++)
read(E[i].u , E[i].v);
for (int i = 1 ; i <= q ; i ++) {
read(Q[i].op , Q[i].x);
if (Q[i].op == 2)
vis[Q[i].x] = 1;
}
for (int i = 1 ; i <= m ; i ++)
if (!vis[i])
merge (E[i].u, E[i].v, q);
for (int i = q ; i >= 1 ; i --)
if (Q[i].op == 2)
merge (E[Q[i].x].u, E[Q[i].x].v, i);
for (int i = 1 ; i <= ntot ; i ++)
if (findroot (i) == i)
dfs (i, 0);
deal();
for (int i = 1 ; i <= n ; i ++)
insert (1, 1, ntot, dfn[i], a[i]);
for (int i = 1; i <= q ;i ++)
{
if (Q[i].op == 1)
{
int u = Q[i].x;
for (int j = 20 ; j >= 0 ; j --)
{
if (val[bz[u][j]] >= i)
u = bz[u][j];
}
auto tmp = query (1, 1 , ntot, dfn[u], dfn[u] + siz[u] - 1);
write(tmp.fi), LF;
if (tmp.se != 0)
insert (1, 1, ntot, tmp.se, 0);
}
}
}