AtCoder Beginner Contest 196
E
Filters
AtCoder
⌀ 1650
原题
← DF →
翻译中…

Problem Statement

翻译中…

Given are integer sequences $A = (a_1, a_2, \dots, a_N)$, $T = (t_1, t_2, \dots, t_N)$, and $X = (x_1, x_2, \dots, x_Q)$. Let us define $N$ functions $f_1(x), f_2(x), \dots, f_N(x)$ as follows:

翻译中…

$f_i(x) = \begin{cases} x + a_i & (t_i = 1)\\ \max(x, a_i) & (t_i = 2)\\ \min(x, a_i) & (t_i = 3)\\ \end{cases}$

翻译中…

For each $i = 1, 2, \dots, Q$, find $f_N( \dots f_2(f_1(x_i)) \dots )$.

翻译中…

Constraints

翻译中…
  • All values in input are integers.
  • $1 ≤ N ≤ 2 \times 10^5$
  • $1 ≤ Q ≤ 2 \times 10^5$
  • $|a_i| ≤ 10^9$
  • $1 ≤ t_i ≤ 3$
  • $|x_i| ≤ 10^9$
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

N
a_1 t_1
a_2 t_2
\vdots
a_N t_N
Q
x_1 x_2 \cdots x_Q

翻译中…

Output

翻译中…

Print $Q$ lines. The $i$-th line should contain $f_N( \dots f_2(f_1(x_i)) \dots )$.

翻译中…

样例

Input #1
3
-10 2
10 1
10 3
5
-15 -10 -5 0 5
Output #1
0
0
5
10
10
We have $f_1(x) = \max(x, -10), f_2(x) = x + 10, f_3(x) = \min(x, 10)$, thus: - $f_3(f_2(f_1(-15))) = 0$ - $f_3(f_2(f_1(-10))) = 0$ - $f_3(f_2(f_1(-5))) = 5$ - $f_3(f_2(f_1(0))) = 10$ - $f_3(f_2(f_1(5))) = 10$
题目信息
题号
abc196_e
时间限制
2 s
内存限制
1024 MB

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