Codeforces Round 431 (Div. 1)
C
Goodbye Souvenir
Codeforces
2600
原题
← BD →
翻译中…

I won't feel lonely, nor will I be sorrowful... not before everything is buried.

翻译中…

A string of $*n*$ beads is left as the message of leaving. The beads are numbered from $1$ to $*n*$ from left to right, each having a shape numbered by integers between $1$ and $*n*$ inclusive. Some beads may have the same shapes.

翻译中…

The memory of a shape $*x*$ in a certain subsegment of beads, is defined to be the difference between the last position and the first position that shape $*x*$ appears in the segment. The memory of a subsegment is the sum of memories over all shapes that occur in it.

翻译中…

From time to time, shapes of beads change as well as the memories. Sometimes, the past secreted in subsegments are being recalled, and you are to find the memory for each of them.

翻译中…

Input

翻译中…

The first line of input contains two space-separated integers $*n*$ and $*m*$ ($1 ≤ *n*, *m* ≤ 100 000$) — the number of beads in the string, and the total number of changes and queries, respectively.

翻译中…

The second line contains $*n*$ integers $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ ($1 ≤ *a*_{*i*} ≤ *n*$) — the initial shapes of beads $1, 2, ..., *n*$, respectively.

翻译中…

The following $*m*$ lines each describes either a change in the beads or a query of subsegment. A line has one of the following formats:

翻译中…
  • 1 p x ($1 ≤ *p* ≤ *n*$, $1 ≤ *x* ≤ *n*$), meaning that the shape of the $*p*$-th bead is changed into $*x*$;
  • 2 l r ($1 ≤ *l* ≤ *r* ≤ *n*$), denoting a query of memory of the subsegment from $*l*$ to $*r*$, inclusive.
翻译中…

Output

翻译中…

For each query, print one line with an integer — the memory of the recalled subsegment.

翻译中…

Note

翻译中…

The initial string of beads has shapes $(1, 2, 3, 1, 3, 2, 1)$.

翻译中…

Consider the changes and queries in their order:

翻译中…
  1. 2 3 7: the memory of the subsegment $[3, 7]$ is $(7 - 4) + (6 - 6) + (5 - 3) = 5$;
  2. 2 1 3: the memory of the subsegment $[1, 3]$ is $(1 - 1) + (2 - 2) + (3 - 3) = 0$;
  3. 1 7 2: the shape of the $7$-th bead changes into $2$. Beads now have shapes $(1, 2, 3, 1, 3, 2, 2)$ respectively;
  4. 1 3 2: the shape of the $3$-rd bead changes into $2$. Beads now have shapes $(1, 2, 2, 1, 3, 2, 2)$ respectively;
  5. 2 1 6: the memory of the subsegment $[1, 6]$ is $(4 - 1) + (6 - 2) + (5 - 5) = 7$;
  6. 2 5 7: the memory of the subsegment $[5, 7]$ is $(7 - 6) + (5 - 5) = 1$.
翻译中…

样例

Input #1
7 6
1 2 3 1 3 2 1
2 3 7
2 1 3
1 7 2
1 3 2
2 1 6
2 5 7
Output #1
5
0
7
1
InputCopy OutputCopy
Input #2
7 5
1 3 2 1 4 2 3
1 1 4
2 2 3
1 1 7
2 4 5
1 1 7
Output #2
0
0
InputCopy OutputCopy
题目信息
题号
848C
时间限制
6 s
内存限制
256 MB
标签
数据结构
分治

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。