Codeforces Round 426 (Div. 1)
E
Caramel Clouds
Codeforces
3400
原题
← D→
翻译中…

image

翻译中…

It is well-known that the best decoration for a flower bed in Sweetland are vanilla muffins. Seedlings of this plant need sun to grow up. Slastyona has $*m*$ seedlings, and the $*j*$-th seedling needs at least $*k*_{*j*}$ minutes of sunlight to grow up.

翻译中…

Most of the time it's sunny in Sweetland, but sometimes some caramel clouds come, the $*i*$-th of which will appear at time moment (minute) $*l*_{*i*}$ and disappear at time moment $*r*_{*i*}$. Of course, the clouds make shadows, and the seedlings can't grow when there is at least one cloud veiling the sun.

翻译中…

Slastyona wants to grow up her muffins as fast as possible. She has exactly $*C*$ candies, which is the main currency in Sweetland.

翻译中…

One can dispel any cloud by paying $*c*_{*i*}$ candies. However, in order to comply with Sweetland's Department of Meteorology regulations, one can't dispel more than two clouds.

翻译中…

Slastyona hasn't decided yet which of the $*m*$ seedlings will be planted at the princess' garden, so she needs your help. For each seedling determine the earliest moment it can grow up if Slastyona won't break the law and won't spend more candies than she has. Note that each of the seedlings is considered independently.

翻译中…

The seedlings start to grow at time moment $0$.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*C*$ $(0 ≤ *n* ≤ 3·10^{5}, 0 ≤ *C* ≤ 10^{9})$ – the number of caramel clouds and the number of candies Slastyona has.

翻译中…

The next $*n*$ lines contain three integers each: $*l*_{*i*}, *r*_{*i*}, *c*_{*i*}$ $(0 ≤ *l*_{*i*} < *r*_{*i*} ≤ 10^{9}, 0 ≤ *c*_{*i*} ≤ 10^{9})$, describing one caramel cloud.

翻译中…

The next line contains single integer $*m*$ ($1 ≤ *m* ≤ 3·10^{5})$ – the number of seedlings. Each of the seedlings is described with one integer $*k*_{*j*}$ $(1 ≤ *k*_{*j*} ≤ 10^{9})$ – the required number of sunny minutes.

翻译中…

Output

翻译中…

For each seedling print one integer – the minimum minute Slastyona can grow it up.

翻译中…

Note

翻译中…

Consider the first example. For each $*k*$ it is optimal to dispel clouds $1$ and $3$. Then the remaining cloud will give shadow on time segment $[1..6]$. So, intervals $[0..1]$ and $[6..*inf*)$ are sunny.

翻译中…

image

翻译中…

In the second example for $*k* = 1$ it is not necessary to dispel anything, and for $*k* = 5$ the best strategy is to dispel clouds $2$ and $3$. This adds an additional sunny segment $[4..8]$, which together with $[0..1]$ allows to grow up the muffin at the eight minute.

翻译中…

image image

翻译中…

If the third example the two seedlings are completely different. For the first one it is necessary to dispel cloud $1$ and obtain a sunny segment $[0..10]$. However, the same strategy gives answer $180$ for the second seedling. Instead, we can dispel cloud $2$, to make segments $[0..3]$ and $[7..*inf*)$ sunny, and this allows up to shorten the time to $104$.

翻译中…

样例

Input #1
3 5
1 7 1
1 6 2
1 7 1
3
7
2
5
Output #1
12
7
10
InputCopy OutputCopy
Input #2
3 15
1 4 17
2 8 6
4 8 9
2
5
1
Output #2
8
1
InputCopy OutputCopy
Input #3
2 10
3 7 9
10 90 10
2
10
100
Output #3
10
104
InputCopy OutputCopy
题目信息
题号
833E
时间限制
3 s
内存限制
256 MB
标签
数据结构
动态规划
排序

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。