|
||||||||||
Photoshop LayersTime Limit: 3000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1737 Accepted Submission(s): 635 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\}$):
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. Sample Input
Sample Output
Source | ||||||||||
|