D. Ralph And His Tour in Binary Country
time limit per test

2.5 seconds

memory limit per test

512 megabytes

input

standard input

output

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.

Input

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).

Output

Print m lines, on the i-th line print one integer — the answer for the i-th query.

Examples
input
2 2
5
1 8
2 4
output
11
4
input
6 4
2
1
1
3
2
2 4
1 3
3 2
1 7
output
11
6
3
28
Note

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的更多相关文章

  1. 【Codeforces】894D. Ralph And His Tour in Binary Country 思维+二分

    题意 给定一棵$n$个节点完全二叉树,$m$次询问,每次询问从$a$节点到其它所有节点(包括自身)的距离$L$与给定$H_a$之差$H_a-L$大于$0$的值之和 对整棵树从叶子节点到父节点从上往下预 ...

  2. [codeforces 894 E] Ralph and Mushrooms 解题报告 (SCC+拓扑排序+DP)

    题目链接:http://codeforces.com/problemset/problem/894/E 题目大意: $n$个点$m$条边的有向图,每条边有一个权值,可以重复走. 第$i$次走过某条边权 ...

  3. 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 ...

  4. 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 ...

  5. 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 ...

  6. 【Codeforces】894E.Ralph and Mushrooms Tarjan缩点+DP

    题意 给定$n$个点$m$条边有向图及边权$w$,第$i$次经过一条边边权为$w-1-2.-..-i$,$w\ge 0$给定起点$s$问从起点出发最多能够得到权和,某条边可重复经过 有向图能够重复经过 ...

  7. Codeforces 894.A QAQ

    A. QAQ time limit per test 1 second memory limit per test 256 megabytes input standard input output ...

  8. Codeforces Round #307 (Div. 2) D. GukiZ and Binary Operations (矩阵高速幂)

    题目地址:http://codeforces.com/contest/551/problem/D 分析下公式能够知道,相当于每一位上放0或者1使得最后成为0或者1.假设最后是0的话,那么全部相邻位一定 ...

  9. 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 ...

随机推荐

  1. 数据库MySql在python中的使用

    随着需要存储数据的结构不断复杂化,使用数据库来存储数据是一个必须面临的问题.那么应该如何在python中使用数据库?下面就在本篇博客中介绍一下在python中使用mysql. 首先,本博客已经假定阅读 ...

  2. eclipse启动一闪而退

    eclipse启动一闪而退 打开eclipse,启动画面一闪而过退出. 解决方法: 以下每一步结束都重启eclipse一下,看能不能正常启动. 1. 在C:/WINDOWS/system32 系统文件 ...

  3. BZOJ 1559 JSOI2009 密码 状压dp+AC自动机+搜索

    题目链接:https://www.lydsy.com/JudgeOnline/problem.php?id=1559 分析: 这个题意真的是很**啊!!!直接说每一个字符串至少出现一次不就好了吗... ...

  4. 调试和开发npm模块的方式

    ln -s(软连接) 假设my-project是运行npm模块的项目,vue-router是我们需要调试的npm模块 将vue-router下载到与my-project同级目录中. git clone ...

  5. WIN 7 发布项目

    本人工作都快两年了不知道web 怎么发布 今天我自己非常恼火!我就暗暗研究.希望能给新手指导 准备工作:WIN7 系统 .IIS 6.0.MVC (vs 新建mvc项目自带的项目) OK begin ...

  6. 期中HTML代码及技术博客

      <!DOCTYPE html>   <html lang="en">   <head>   <meta charset="U ...

  7. Java 数组转字符

    public static String toString(int[] arr){ String temp = ""; for(int i = 0;i<arr.length; ...

  8. lintcode-413-反转整数

    413-反转整数 将一个整数中的数字进行颠倒,当颠倒后的整数溢出时,返回 0 (标记为 32 位整数). 样例 给定 x = 123,返回 321 给定 x = -123,返回 -321 标签 整数 ...

  9. Spring源码解析 – AnnotationConfigApplicationContext容器创建过程

    Spring在BeanFactory基础上提供了一些列具体容器的实现,其中AnnotationConfigApplicationContext是一个用来管理注解bean的容器,从AnnotationC ...

  10. QSettings配置读写-win注册表操作-ini文件读写

    版权声明:若无来源注明,Techie亮博客文章均为原创. 转载请以链接形式标明本文标题和地址: 本文标题:QSettings配置读写-win注册表操作-ini文件读写     本文地址:http:// ...