P7446 [Ynoi2007] rfplca

Given a rooted tree of size $n$ with node $1$ as the root. The tree is given in the following way: you are given $a_2,a_3,\dots,a_n$, and it is guaranteed that $1\leq a_i

The first line contains two integers $n$ and $m$. The next line contains $n-1$ integers, representing $a_2,\dots,a_n$. Then follow $m$ lines, each containing three or four integers, representing one operation. **This problem is forced online. All inputs $l,r,x,u,v$ must be XORed with $lastans$, where $lastans$ is defined as the answer of the previous query operation. If there has been no query operation before, then it is $0$.**

For each operation of type $2$, output one line with one integer as the answer.

Idea: Ynoi, Solution: Ynoi, Code: Ynoi, Data: Ynoi&nzhtl1477 For $100\%$ of the testdata, it holds that $2\leq n,m\leq 4\times 10^5$, $2\leq l\leq r\leq n$, $1\leq x\leq 4\times 10^5$, $1\leq u,v\leq n$. Translated by ChatGPT 5