| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 1024 MB | 112 | 39 | 31 | 32.979% |
Farmer John wrote down $N$ (1ドル\le N\le 300$) digits on pieces of paper. For each $i\in [1,N],ドル the $i$th piece of paper contains digit $a_i$ (1ドル \leq a_i \leq 9$).
The cows have two favorite integers $A$ and $B$ (1ドル\le A\le B< 10^{18}$), and would like you to answer $Q$ (1ドル\le Q\le 5\cdot 10^4$) queries. For the $i$th query, the cows will move left to right across papers $l_i\dots r_i$ (1ドル\le l_i\le r_i\le N$), maintaining an initially empty pile of papers. For each paper, they will either add it to the top of the pile, to the bottom of the pile, or neither. In the end, they will read the papers in the pile from top to bottom, forming an integer. Over all 3ドル^{r_i-l_i+1}$ ways for the cows to make choices during this process, count the number of ways that result in the cows reading an integer in $[A,B]$ inclusive, and output this number modulo 10ドル^9+7$.
The first line contains three space-separated integers $N,ドル $A,ドル and $B$.
The second line contains $N$ space-separated digits $a_1, a_2, \dots, a_N$.
The third line contains an integer $Q,ドル the number of queries.
The next $Q$ lines each contain two space-separated integers $l_i$ and $r_i$.
For each query, a single line containing the answer.
5 13 327 1 2 3 4 5 3 1 2 1 3 2 5
2 18 34
For the first query, there are nine ways Bessie can stack papers when reading the interval $[1, 2]$:
Only the 2ドル$ ways that give 21ドル$ yield a number between 13ドル$ and 327ドル,ドル so the answer is 2ドル$.