Codeforces 292 E. Copying Data （线段树）

Posted 2022-08-13 小坏蛋_千千

Description

We often have to copy large volumes of information. Such operation can take up many computer resources. Therefore, in this problem you are advised to come up with a way to copy some part of a number array into another one, quickly.

More formally, you’ve got two arrays of integers $a_1, a_2, ..., a_n$ and $b_1, b_2, ..., b_n$ of length $n$ . Also, you’ve got $m$ queries of two types:

Copy the subsegment of array $a$ of length $k$, starting from position $x$, into array $b$, starting from position $y$, that is, execute $b_y + q = a_x + q$ for all integer $q$ $(0 ≤ q < k)$. The given operation is correct — both subsegments do not touch unexistent elements.

Determine the value in position $x$ of array $b$, that is, find value $b_x$ .

For each query of the second type print the result — the value of the corresponding element of array $b$.

 

Input

The first line contains two space-separated integers $n$ and $m$ $(1 ≤ n, m ≤ 10^5)$ — the number of elements in the arrays and the number of queries, correspondingly. The second line contains an array of integers $a_1, a_2, ..., a_n$ $(|a_i| ≤ 10^9)$. The third line contains an array of integers $b_1, b_2, ..., b_n$ $(|b_i| ≤ 10^9)$.

Next $m$ lines contain the descriptions of the queries. The i-th line first contains integer $t_i$ — the type of the i-th query $(1 ≤ ti ≤ 2)$. If $t_i = 1$, then the i-th query means the copying operation. If $t_i = 2$, then the i-th query means taking the value in array $b$. If $t_i = 1$, then the query type is followed by three integers xi, 以上是关于Codeforces 292 E. Copying Data （线段树）的主要内容，如果未能解决你的问题，请参考以下文章

Codeforces 292D Connected Components (并查集)

Codeforces Round #292 (Div. 2) C. Drazil and Factorial 515C

Codeforces Codeforces Round #484 (Div. 2) E. Billiard

codeforces 598E E. Chocolate Bar(区间dp)

E. 因数串

E. Boxers （ Codeforces Round #579 ）