XORing String :
Difficulty Level : Medium
Submissions : 1420
Asked In :
Marks :10
: 28 | : 2
You are given a string $$$s$$$ consisting of lowercase Latin letters $$$(a-z)$$$. The score of a string is defined as the XOR of the frequencies of all the distinct letters in the string. You are required to handle two types of queries:
- 1 L R : Answer the score of the substring from L to R.
- 2 X Y : Update the character at the position X to the Y$$$_{th}$$$ letter in the English Alphabet
Input
The first line of the input consists of a string $$$s$$$ $$$(1 \leq |s| \leq 10^6)$$$. The second line consists of a single integer $$$q$$$ $$$(1 \leq q \leq 10^6)$$$ $$$-$$$ the total number of queries. Then each of the next $$$q$$$ lines are queries of either of the following two types:
- 1 L R : $$$(1 \leq L \leq R \leq |s|)$$$
- 2 X Y : $$$(1 \leq X \leq |s|)$$$ , $$$(1 \leq Y \leq 26)$$$
Output
For each query of type 1, you should output a single integer - the XOR of the frequencies of all distinct characters in that particular substring.
Example
Input
tti 4 2 3 1 1 1 2 2 1 2 1 2 3
Output
2 0
