P8512 [Ynoi Easy Round 2021] TEST_152

Zhuanzhuan has an operation sequence of length $n$, $(l_i, r_i, v_i)$. Now there are $q$ queries $(L, R)$. For each query, you initially have a sequence $c$ of length $m$, with all initial values equal to $0$. Now we execute, in order, the operations corresponding to items $L, L+1, L+2, \cdots, R$ of the operation sequence. Each operation sets $c_{l_i}$ through $c_{r_i}$ to $v_i$. For each query, output the sum of all numbers in the entire sequence $c$ after all operations finish. Queries are independent of each other.

The first line contains three positive integers $n, m, q$. Lines $2$ to $n+1$ each contain three positive integers. Line $i+1$ gives $l_i, r_i, v_i$. The next $q$ lines each contain two positive integers, describing one query $L, R$.

Output $q$ lines, each containing one positive integer, the answer to the query.

Idea: Ynoi, Solution: Ynoi, Code: Ynoi, Data: Ynoi For $100\%$ of the testdata, it holds that: $1 \le n, m, q \le 5 \times 10^5$. $1 \le l_i \le r_i \le m$. $0 \le v_i \le 2 \times 10^9$. $1 \le L \le R \le n$. Translated by ChatGPT 5