Codeforces Round 254 (Div. 1)
C
DZY Loves Colors
Codeforces
2400
原题
← BD →
翻译中…

DZY loves colors, and he enjoys painting.

翻译中…

On a colorful day, DZY gets a colorful ribbon, which consists of $*n*$ units (they are numbered from $1$ to $*n*$ from left to right). The color of the $*i*$-th unit of the ribbon is $*i*$ at first. It is colorful enough, but we still consider that the colorfulness of each unit is $0$ at first.

翻译中…

DZY loves painting, we know. He takes up a paintbrush with color $*x*$ and uses it to draw a line on the ribbon. In such a case some contiguous units are painted. Imagine that the color of unit $*i*$ currently is $*y*$. When it is painted by this paintbrush, the color of the unit becomes $*x*$, and the colorfulness of the unit increases by $|*x* - *y*|$.

翻译中…

DZY wants to perform $*m*$ operations, each operation can be one of the following:

翻译中…
  1. Paint all the units with numbers between $*l*$ and $*r*$ (both inclusive) with color $*x*$.
  2. Ask the sum of colorfulness of the units between $*l*$ and $*r*$ (both inclusive).
翻译中…

Can you help DZY?

翻译中…

Input

翻译中…

The first line contains two space-separated integers $*n*, *m* (1 ≤ *n*, *m* ≤ 10^{5})$.

翻译中…

Each of the next $*m*$ lines begins with a integer $*type* (1 ≤ *type* ≤ 2)$, which represents the type of this operation.

翻译中…

If $*type* = 1$, there will be $3$ more integers $*l*, *r*, *x* (1 ≤ *l* ≤ *r* ≤ *n*; 1 ≤ *x* ≤ 10^{8})$ in this line, describing an operation $1$.

翻译中…

If $*type* = 2$, there will be $2$ more integers $*l*, *r* (1 ≤ *l* ≤ *r* ≤ *n*)$ in this line, describing an operation $2$.

翻译中…

Output

翻译中…

For each operation $2$, print a line containing the answer — sum of colorfulness.

翻译中…

Note

翻译中…

In the first sample, the color of each unit is initially $[1, 2, 3]$, and the colorfulness is $[0, 0, 0]$.

翻译中…

After the first operation, colors become $[4, 4, 3]$, colorfulness become $[3, 2, 0]$.

翻译中…

After the second operation, colors become $[4, 5, 5]$, colorfulness become $[3, 3, 2]$.

翻译中…

So the answer to the only operation of type $2$ is $8$.

翻译中…

样例

Input #1
3 3
1 1 2 4
1 2 3 5
2 1 3
Output #1
8
InputCopy OutputCopy
Input #2
3 4
1 1 3 4
2 1 1
2 2 2
2 3 3
Output #2
3
2
1
InputCopy OutputCopy
Input #3
10 6
1 1 5 3
1 2 7 9
1 10 10 11
1 3 8 12
1 1 10 3
2 1 10
Output #3
129
InputCopy OutputCopy
题目信息
题号
444C
时间限制
2 s
内存限制
256 MB
标签
数据结构

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