Codeforces 894.D Ralph And His Tour in Binary Country
2.5 seconds
512 megabytes
standard input
standard output
Ralph is in the Binary Country. The Binary Country consists of n cities and (n - 1) bidirectional roads connecting the cities. The roads are numbered from 1 to (n - 1), the i-th road connects the city labeled (here ⌊ x⌋ denotes the x rounded down to the nearest integer) and the city labeled (i + 1), and the length of the i-th road is Li.
Now Ralph gives you m queries. In each query he tells you some city Ai and an integer Hi. He wants to make some tours starting from this city. He can choose any city in the Binary Country (including Ai) as the terminal city for a tour. He gains happiness (Hi - L) during a tour, where L is the distance between the city Ai and the terminal city.
Ralph is interested in tours from Ai in which he can gain positive happiness. For each query, compute the sum of happiness gains for all such tours.
Ralph will never take the same tour twice or more (in one query), he will never pass the same city twice or more in one tour.
The first line contains two integers n and m (1 ≤ n ≤ 106, 1 ≤ m ≤ 105).
(n - 1) lines follow, each line contains one integer Li (1 ≤ Li ≤ 105), which denotes the length of the i-th road.
m lines follow, each line contains two integers Ai and Hi (1 ≤ Ai ≤ n, 0 ≤ Hi ≤ 107).
Print m lines, on the i-th line print one integer — the answer for the i-th query.
2 2
5
1 8
2 4
11
4
6 4
2
1
1
3
2
2 4
1 3
3 2
1 7
11
6
3
28
Here is the explanation for the second sample.
Ralph's first query is to start tours from city 2 and Hi equals to 4. Here are the options:
- He can choose city 5 as his terminal city. Since the distance between city 5 and city 2 is 3, he can gain happiness 4 - 3 = 1.
- He can choose city 4 as his terminal city and gain happiness 3.
- He can choose city 1 as his terminal city and gain happiness 2.
- He can choose city 3 as his terminal city and gain happiness 1.
- Note that Ralph can choose city 2 as his terminal city and gain happiness 4.
- Ralph won't choose city 6 as his terminal city because the distance between city 6 and city 2 is 5, which leads to negative happiness for Ralph.
So the answer for the first query is 1 + 3 + 2 + 1 + 4 = 11.
大致题意:m次询问,每次给定一个a和h,第i个点的贡献是h减i到a的距离,求大于0的贡献.
分析:非常棒的一道题!改变了我对cf测评机的认识.我一开始错误地认为只需要求出一个点祖先的贡献和它的子树的节点的贡献就好了,没有考虑到还有一种情况:它的父亲的其它儿子的子树可能还有贡献.这样的话就必须求出每个点为根的子树中每个点到根节点的距离.事实上只需要存下距离就够了,因为我们不关心到底是哪一个点.我原本以为内存会爆掉,因为n有10^6,要把每个点都给保存下来,还有保存子树的所有点的距离,数组绝对是开不下的,但是如果不求出这个是无法继续做下去的,于是用vector,竟然没有爆内存,神奇.
因为题目给定的是一个二叉树,每个节点的编号都是有规律的,所以可以从第n号点从下往上更新,利用左右儿子的信息去更新根节点的信息.为了在查询的时候方便一些,可以维护一下前缀和,即第i个点的子树中前j个距离的和,这样可以利用vector的upper_bound来快速查找关键点p,利用公式进行O(1)计算.
接下来的事情就很好办了,每次从查询的点开始,先看看左右子树之前有没有被查询,如果没有就查询一下,完了之后就跳到祖先,并记录上一次查询的是哪一个点,下次就不查询它了.
参考了网上神犇的vector的写法,用得很6,个人认为它最大的用处是关于内存方面的.这道题也纠正了我的一个常识性错误:if (k) ......我一直以为如果k > 0这个判断语句才会成立,万万没想到是k != 0这个语句就成立了,看来还是基本功不扎实,要多多练习.
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm> using namespace std; typedef long long ll; const int maxn = ;
vector <ll>e[maxn], sum[maxn];
ll n, m, len[maxn], a, h;
ll ans; ll query(ll x, ll h)
{
if (h <= )
return ;
ll p = upper_bound(e[x].begin(), e[x].end(), h) - e[x].begin();
return p * h - sum[x][p - ];
} void init()
{
for (int i = n; i >= ; i--)
{
e[i].push_back();
int lc = i * , rc = i * + ;
if (lc <= n)
{
for (int j = ; j < e[lc].size(); j++)
e[i].push_back(e[lc][j] + len[lc]);
}
if (rc <= n)
{
for (int j = ; j < e[rc].size(); j++)
e[i].push_back(e[rc][j] + len[rc]);
}
sort(e[i].begin(), e[i].end());
sum[i].resize(e[i].size());
for (int j = ; j < sum[i].size(); j++)
sum[i][j] = sum[i][j - ] + e[i][j];
}
} int main()
{
cin >> n >> m;
for (int i = ; i <= n; i++)
scanf("%I64d", &len[i]);
init();
while (m--)
{
ans = ;
scanf("%I64d%I64d", &a, &h);
ll last = ;
while (a && h >= )
{
ans += h;
ll lc = a * , rc = a * + ;
if (last != lc && lc <= n)
ans += query(lc, h - len[lc]);
if (last != rc && rc <= n)
ans += query(rc, h - len[rc]);
last = a;
h -= len[a];
a /= ;
}
printf("%I64d\n", ans);
} return ;
}
Codeforces 894.D Ralph And His Tour in Binary Country的更多相关文章
- 【Codeforces】894D. Ralph And His Tour in Binary Country 思维+二分
题意 给定一棵$n$个节点完全二叉树,$m$次询问,每次询问从$a$节点到其它所有节点(包括自身)的距离$L$与给定$H_a$之差$H_a-L$大于$0$的值之和 对整棵树从叶子节点到父节点从上往下预 ...
- [codeforces 894 E] Ralph and Mushrooms 解题报告 (SCC+拓扑排序+DP)
题目链接:http://codeforces.com/problemset/problem/894/E 题目大意: $n$个点$m$条边的有向图,每条边有一个权值,可以重复走. 第$i$次走过某条边权 ...
- Codeforces 894.E Ralph and Mushrooms
E. Ralph and Mushrooms time limit per test 2.5 seconds memory limit per test 512 megabytes input sta ...
- Codeforces 894.B Ralph And His Magic Field
B. Ralph And His Magic Field time limit per test 1 second memory limit per test 256 megabytes input ...
- Codeforces 894.C Marco and GCD Sequence
C. Marco and GCD Sequence time limit per test 1 second memory limit per test 256 megabytes input sta ...
- 【Codeforces】894E.Ralph and Mushrooms Tarjan缩点+DP
题意 给定$n$个点$m$条边有向图及边权$w$,第$i$次经过一条边边权为$w-1-2.-..-i$,$w\ge 0$给定起点$s$问从起点出发最多能够得到权和,某条边可重复经过 有向图能够重复经过 ...
- Codeforces 894.A QAQ
A. QAQ time limit per test 1 second memory limit per test 256 megabytes input standard input output ...
- Codeforces Round #307 (Div. 2) D. GukiZ and Binary Operations (矩阵高速幂)
题目地址:http://codeforces.com/contest/551/problem/D 分析下公式能够知道,相当于每一位上放0或者1使得最后成为0或者1.假设最后是0的话,那么全部相邻位一定 ...
- Educational Codeforces Round 75 (Rated for Div. 2) B. Binary Palindromes
链接: https://codeforces.com/contest/1251/problem/B 题意: A palindrome is a string t which reads the sam ...
随机推荐
- vim—多行注释、取消多行注释
多行注释 命令模式: (1)将光标放在要注释的行首,按下组合键ctrl + v ,然后按上下键选取要注释的行. (2)按下大i键,然后插入要注释的符号 # (3)按ESC键,退出后,就会全部注释. 取 ...
- PReLU——Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification
1. 摘要 在 \(ReLU\) 的基础上作者提出了 \(PReLU\),在几乎没有增加额外参数的前提下既可以提升模型的拟合能力,又能减小过拟合风险. 针对 \(ReLU/PReLU\) 的矫正非线性 ...
- angularjs工作原理解析
个人觉得,要很好的理解AngularJS的运行机制,才能尽可能避免掉到坑里面去.在这篇文章中,我将根据网上的资料和自己的理解对AngularJS的在启动后,每一步都做了些什么,做一个比较清楚详细的解析 ...
- js 插件 issue
1 iscroll 5 和 lazyload 同时使用 转自 yinjie //lazyload var $scrollEle = $("#wrapper") $("i ...
- 【Alpha】阶段第二次Scrum Meeting
[Alpha]阶段第二次Scrum Meeting 工作情况 团队成员 今日已完成任务 明日待完成任务 刘峻辰 发表评论接口 更新评论接口 赵智源 部署实际项目 编写脚本实现持续集成 肖萌威 编写注册 ...
- java一些知识
类名前只有两种修饰符:不写(即default,但不能把default写上去)或public.默认不写则此类只能被同一包下的类调用以生成相应的实例.但若是public,则可以被不同包下的类调用以生成其实 ...
- jdbc 2.0
1.Statement接口不能接受参数 2.PreparedStatement接口在运行时接受输入参数 3.CallableStatement接口也可以接受运行时输入参数,当想要访问数据库存储过程时使 ...
- HTMLA内联框架
<head> <meta charset="utf-8" /> <title>内联框架</title> </head> ...
- IT行业所面临的问题
在阅读了“2015 IT行业大学生就业分析报告”和“2014年十大最热门行业和职业排行榜 IT行业最吃香_联展新闻”两则新闻后,我决定用一篇和老师对话的形式来表达我的感受. dym:人潮汹涌的招聘市场 ...
- Maven的setting配置文件
一.Maven的setting配置文件 和 在Eclipse中对Maven的正确配置. 1.Maven的配置文件(Maven的安装目录/conf/settings.xml ) 和 Maven仓库下(默 ...