31626번 - Gift Exchange 서브태스크다국어

JOI Academy has $N$ students, numbered from $1$ to $N$.

A gift exchange party is planned to be held soon at JOI Academy. Each student has prepared a gift to bring there, and the value of the gift that student $i$ ($1 ≤ i ≤ N$) will bring is $A_i$. Students are unwilling to receive a gift whose value is too less than that of their own gift. Specifically, student $i$ will be dissatisfied if they receive a gift with a value strictly less than $B_i$. Here, $B_i < A_i$ always holds.

However, some of the $N$ students may not actually participate in the party. President $K$, the director of JOI Academy, is considering $Q$ possible groups of students as a group to participate in the gift exchange party, $j$-th ($1 ≤ j ≤ Q$) of which consists of $R_j - L_j + 1$ students $L_j , L_j + 1,\dots , R_j$.

For some group of two or more students, if it is possible to exchange gifts within the group without anyone receiving their own gift or getting dissatisfied, that group is said to be gift exchangeable. More formally, a group of $m$ students ($m ≥ 2$) $p_1, p_2, \dots , p_m$ is gift exchangeable if and only if there exists a sequence $q_1, q_2, \dots , q_m$ which is a permutation of $p_1, p_2, \dots , p_m$ and satisfies each of the following conditions. Here, $q_k$ ($1 ≤ k ≤ m$) represents the number of student who gives their gift to student $p_k$.

• For all $k$ ($1 ≤ k ≤ m$)，$p_k \ne q_k$.
• For all $k$ ($1 ≤ k ≤ m$)，$A_{q_k} ≥ B_{p_k}$.

President K is keen to make the gift exchange party successful, and thus examining whether each of the $Q$ groups is gift exchangeable or not.

Write a program which, given information of students and groups, determines whether each of the $Q$ groups is gift exchangeable or not.

Read the following data from the standard input.

$N$

$A_1$ $A_2$ $\cdots$ $A_N$

$B_1$ $B_2$ $\cdots$ $B_N$

$Q$

$L_1$ $R_1$

$L_2$ $R_2$

$\vdots$

$L_Q$ $R_Q$

Write $Q$ lines to the standard output. On the $j$-th line ($1 ≤ j ≤ Q$), output Yes if the $j$-th group is gift exchangeable, and No otherwise.

• $2 ≤ N ≤ 500\, 000$.
• $1 ≤ B_i < A_i ≤ 2N$ ($1 ≤ i ≤ N$). $A_1, B_1, A_2, B_2, \dots , A_N, B_N$ are all distinct.
• $1 ≤ Q ≤ 200\, 000$.
• $1 ≤ L_j < R_j ≤ N$ ($1 ≤ j ≤ Q$).
• Given values are all integers.