SPOJ:COT2 Count on a tree II
题意
给定一个n个节点的树,每个节点表示一个整数,问u到v的路径上有多少个不同的整数。
n=40000,m=100000
Sol
树上莫队模板题
# include <bits/stdc++.h>
# define RG register
# define IL inline
# define Fill(a, b) memset(a, b, sizeof(a))
using namespace std;
const int _(1e5 + 5);
typedef long long ll;
IL int Input(){
RG int x = 0, z = 1; RG char c = getchar();
for(; c < '0' || c > '9'; c = getchar()) z = c == '-' ? -1 : 1;
for(; c >= '0' && c <= '9'; c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
return x * z;
}
int n, m, first[_], cnt, w[_], o[_], len;
int dfn[_], st[20][_], lg[_], deep[_], idx, fa[_];
int S[_], bl[_], blo, num, ans[_], sum[_], vis[_], Ans;
struct Edge{
int to, next;
} edge[_];
struct Query{
int l, r, id;
IL int operator <(RG Query B) const{
return bl[l] == bl[B.l] ? dfn[r] < dfn[B.r] : bl[l] < bl[B.l];
}
} qry[_];
IL void Add(RG int u, RG int v){
edge[cnt] = (Edge){v, first[u]}, first[u] = cnt++;
}
IL void Dfs(RG int u){
dfn[u] = ++idx, st[0][idx] = u; RG int l = S[0];
for(RG int e = first[u]; e != -1; e = edge[e].next){
RG int v = edge[e].to;
if(dfn[v]) continue;
deep[v] = deep[u] + 1, fa[v] = u;
Dfs(v);
if(S[0] - l >= blo) for(++num; S[0] != l; --S[0]) bl[S[S[0]]] = num;
st[0][++idx] = u;
}
S[++S[0]] = u;
}
IL void Chk(RG int &x, RG int u, RG int v){
x = deep[u] < deep[v] ? u : v;
}
IL int LCA(RG int u, RG int v){
u = dfn[u], v = dfn[v];
if(u > v) swap(u, v);
RG int log2 = lg[v - u + 1], t;
Chk(t, st[log2][u], st[log2][v - (1 << log2) + 1]);
return t;
}
IL void Update(RG int x){
if(vis[x]) --sum[w[x]], Ans -= (!sum[w[x]]);
else Ans += (!sum[w[x]]), ++sum[w[x]];
vis[x] ^= 1;
}
IL void Modify(RG int u, RG int v){
while(u != v){
if(deep[u] > deep[v]) swap(u, v);
Update(v), v = fa[v];
}
}
int main(RG int argc, RG char* argv[]){
len = n = Input(), m = Input(), blo = sqrt(n);
for(RG int i = 1; i <= n; ++i) o[i] = w[i] = Input(), first[i] = -1;
sort(o + 1, o + len + 1), len = unique(o + 1, o + len + 1) - o - 1;
for(RG int i = 1; i <= n; ++i) w[i] = lower_bound(o + 1, o + len + 1, w[i]) - o;
for(RG int i = 1, u, v; i < n; ++i)
u = Input(), v = Input(), Add(u, v), Add(v, u);
Dfs(1);
if(S[0]) for(++num; S[0]; --S[0]) bl[S[S[0]]] = num;
for(RG int i = 2; i <= idx; ++i) lg[i] = lg[i >> 1] + 1;
for(RG int j = 1; j <= lg[idx]; ++j)
for(RG int i = 1; i + (1 << j) - 1 <= idx; ++i)
Chk(st[j][i], st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
for(RG int i = 1; i <= m; ++i){
qry[i] = (Query){Input(), Input(), i};
if(dfn[qry[i].l] > dfn[qry[i].r]) swap(qry[i].l, qry[i].r);
}
sort(qry + 1, qry + m + 1);
RG int lca = LCA(qry[1].l, qry[1].r);
Modify(qry[1].l, qry[1].r);
Update(lca), ans[qry[1].id] = Ans, Update(lca);
for(RG int i = 2; i <= m; ++i){
Modify(qry[i - 1].l, qry[i].l), Modify(qry[i - 1].r, qry[i].r);
lca = LCA(qry[i].l, qry[i].r);
Update(lca), ans[qry[i].id] = Ans, Update(lca);
}
for(RG int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
return 0;
}
SPOJ:COT2 Count on a tree II的更多相关文章
- SPOJ 10707 COT2 - Count on a tree II
思路 树上莫队的题目 每次更新(u1,u2)和(v1,v2)(不包括lca)的路径,最后单独统计LCA即可 代码 #include <cstdio> #include <cstrin ...
- spoj COT2 - Count on a tree II
COT2 - Count on a tree II http://www.spoj.com/problems/COT2/ #tree You are given a tree with N nodes ...
- SPOJ COT2 - Count on a tree II(LCA+离散化+树上莫队)
COT2 - Count on a tree II #tree You are given a tree with N nodes. The tree nodes are numbered from ...
- COT2 - Count on a tree II(树上莫队)
COT2 - Count on a tree II You are given a tree with N nodes. The tree nodes are numbered from 1 to N ...
- 【SPOJ10707】 COT2 Count on a tree II
SPOJ10707 COT2 Count on a tree II Solution 我会强制在线版本! Solution戳这里 代码实现 #include<stdio.h> #inclu ...
- SPOJ COT2 Count on a tree II(树上莫队)
题目链接:http://www.spoj.com/problems/COT2/ You are given a tree with N nodes.The tree nodes are numbere ...
- SPOJ COT2 Count on a tree II (树上莫队)
题目链接:http://www.spoj.com/problems/COT2/ 参考博客:http://www.cnblogs.com/xcw0754/p/4763804.html上面这个人推导部分写 ...
- SPOJ COT2 Count on a tree II 树上莫队算法
题意: 给出一棵\(n(n \leq 4 \times 10^4)\)个节点的树,每个节点上有个权值,和\(m(m \leq 10^5)\)个询问. 每次询问路径\(u \to v\)上有多少个权值不 ...
- SPOJ COT2 Count on a tree II (树上莫队,倍增算法求LCA)
题意:给一个树图,每个点的点权(比如颜色编号),m个询问,每个询问是一个区间[a,b],图中两点之间唯一路径上有多少个不同点权(即多少种颜色).n<40000,m<100000. 思路:无 ...
随机推荐
- Flink学习笔记:Flink开发环境搭建
本文为<Flink大数据项目实战>学习笔记,想通过视频系统学习Flink这个最火爆的大数据计算框架的同学,推荐学习课程: Flink大数据项目实战:http://t.cn/EJtKhaz ...
- Angular material mat-icon 资源参考_Navigation
ul,li>ol { margin-bottom: 0 } dt { font-weight: 700 } dd { margin: 0 1.5em 1.5em } img { height: ...
- es6 简单封装一个 省市县三级下拉框
废话不多说,直接上效果图和代码: 1,index.js function $(el){ return document.getElementById(el) } let render = Symbol ...
- 使用maven搭建ssm框架的javaweb项目
目前主流的javaweb项目,常会用到ssm(Spring+Spring MVC+Mybatis)框架来搭建项目的主体框架,本篇介绍搭建SSM框架的maven项目的实施流程.记之共享! 一.SSM框架 ...
- UUID生成工具
public class UUIDUtils { private static SecureRandom SEEDER_STATIC = null; private static byte[] ADD ...
- A problem has been detected and windows has been shut down to prevent damage
问题描述 问题解决 参考百度经验, 未解决,重装系统,U盘启动解决.过程可以参考上一篇博文.
- jsp、Servlet的面试题
3. 谈谈Servlet的生命周期 当接收到请求的时候,容器察看对应的Servlet对象是否存在,如果不存在,需要加载Servetl,实例化Servlet,调用init方法进行初始化.如果已经存在,根 ...
- Service启动流程
Service启动流程从整个宏观上来看,它的模型如下 startService启动流程时序图 Activity中使用的startService方法是定义在Context的抽象类中,它的真正实现者是Co ...
- cadence help文件库调出指令 :cdnshelp
cadence help文件库调出指令 :cdnshelp 指令参数记录: Verilog 添加可编译文件后缀名 -vlog_ext +.h,.vh Verilog1995 添加可编译文件后缀名 -v ...
- Failed to start NodeManager caused by "/var/lib/hadoop-yarn/yarn-nm-recovery/yarn-nm-state/LOCK: Permission denied"
Hadoop 安装步骤: 0. 安装前准备(节点机器,环境设置,yum源设置) 1. 配置并安装Cloudera-Manager 2. 启动 CM 服务 3. 安装CDH,并配置集群 4. 启动 ...