VK Cup 2018 Round 1: B. Producing Snow

C. Producing Snow

time limit per test  1 second

memory limit per test  256 megabytes

input  standard input

output  standard output

Alice likes snow a lot! Unfortunately, this year's winter is already over, and she can't expect to have any more of it. Bob has thus bought her a gift — a large snow maker. He plans to make some amount of snow every day. On day i he will make a pile of snow of volume Vi and put it in her garden.

Each day, every pile will shrink a little due to melting. More precisely, when the temperature on a given day is Ti, each pile will reduce its volume by Ti. If this would reduce the volume of a pile to or below zero, it disappears forever. All snow piles are independent of each other.

Note that the pile made on day i already loses part of its volume on the same day. In an extreme case, this may mean that there are no piles left at the end of a particular day.

You are given the initial pile sizes and the temperature on each day. Determine the total volume of snow melted on each day.

Input

The first line contains a single integer N (1 ≤ N ≤ 105) — the number of days.

The second line contains N integers V1, V2, ..., VN (0 ≤ Vi ≤ 109), where Vi is the initial size of a snow pile made on the day i.

The third line contains N integers T1, T2, ..., TN (0 ≤ Ti ≤ 109), where Ti is the temperature on the day i.

Output

Output a single line with N integers, where the i-th integer represents the total volume of snow melted on day i.

Examples

input

Copy

3
10 10 5
5 7 2

output

5 12 4

input

Copy

5
30 25 20 15 10
9 10 12 4 13

output

9 20 35 11 25

题意：你接下来的n天，每天都会堆一个高度为h[i]的雪人，假设第x天的温度为t[x]，那么所有未融化完的雪人都会融化掉t[x]的高度，求每天融化量

二分出每个雪人在第几天时刚好融化完，那么在这中间每一天融化量都会加上一个t[i]，最后一天融化量加上剩余量

其中中间的融化量很显然用倍数表示更好，可以用线段树或差分优化

#include<stdio.h>
#define LL long long
LL a[100005], b[100005], sum[100005], ans[100005];
int flag[100005];
int main(void)
{
	LL bet;
	int i, n, l, r, m, now;
	scanf("%d", &n);
	for(i=1;i<=n;i++)
		scanf("%lld", &a[i]);
	for(i=1;i<=n;i++)
	{
		scanf("%lld", &b[i]);
		sum[i] = sum[i-1]+b[i];
	}
	for(i=1;i<=n;i++)
	{
		l = i, r = n+1;
		while(l<r)
		{
			m = (l+r)/2;
			if(sum[m]-sum[i-1]<a[i])
				l = m+1;
			else
				r = m;
		}
		ans[r] += a[i]-(sum[r-1]-sum[i-1]);
		flag[i]++, flag[r]--;
	}
	bet = 0, now = 0;
	for(i=1;i<=n;i++)
	{
		now += flag[i];
		printf("%lld ", b[i]*now+ans[i]);
	}
	puts("");
	return 0;
}