#P6979. Photoshop Layers

    ID: 5836 远端评测题 3000ms 512MiB 尝试: 0 已通过: 0 难度: (无) 上传者: 标签>2021“MINIEYE杯”中国大学生算法设计超级联赛(3)

Photoshop Layers

Problem Description

Pixels in a digital picture can be represented with three integers $(R,G,B)$ in the range $0$ to $255$ that indicate the intensity of the red, green, and blue colors. The color of a pixel can be expressed as a six-digit hexadecimal capital string. For example, $(R=100,G=255,B=50)$ can be expressed as ''$\texttt{64FF32}$''.

There are $n$ layers in Photoshop workstation, labeled by $1,2,\dots,n$ from bottom to top. The screen will display these layers from bottom to top. In this problem, you only need to handle the case that the color of all the pixels in a layer are the same. The color of the $i$-th layer is $c_i=(R_i,G_i,B_i)$, the blending mode of the $i$-th layer is $m_i$ ($m_i\in\{1,2\}$):

  • If $m_i=1$, the blending mode of this layer is ''Normal''. Assume the previous color displayed on the screen is $(R_p,G_p,B_p)$, now the new color will be $(R_i,G_i,B_i)$.
  • If $m_i=2$, the blending mode of this layer is ''Linear Dodge''. Assume the previous color displayed on the screen is $(R_p,G_p,B_p)$, now the new color will be $(\min(R_p+R_i,255)$, $\min(G_p+G_i,255)$, $\min(B_p+B_i,255))$.
You will be given $q$ queries. In the $i$-th query, you will be given two integers $l_i$ and $r_i$ ($1\leq l_i\leq r_i\leq n$). Please write a program to compute the final color displayed on the screen if we only keep all the layers indexed within $[l_i,r_i]$ without changing their order. Note that the color of the background is $(R=0,G=0,B=0)$.

Input

The first line contains a single integer $T$ ($1 \leq T \leq 10$), the number of test cases. For each test case:

The first line of the input contains two integers $n$ and $q$ ($1 \leq n,q \leq 100\,000$), denoting the number of layers and the number of queries.

In the next $n$ lines, the $i$-th line contains an integer $m_i$ and a six-digit hexadecimal capital string $c_i$, describing the $i$-th layer.

In the next $q$ lines, the $i$-th line contains two integers $l_i$ and $r_i$ ($1\leq l_i\leq r_i\leq n$), describing the $i$-th query.

Output

For each query, print a single line containing a six-digit hexadecimal capital string, denoting the final displayed color.

1 5 5 1 64C832 2 000100 2 010001 1 323C21 2 32C8C8 1 2 1 3 2 3 2 4 2 5
64C932 65C933 010101 323C21 64FFE9