{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cpre\u003e\n题目挑选by wzc\n题面by ccx\n编不动了, 真的编不动了!\n给出一个ai序列, 序列长度为n。初始时序列中(a1 \u003d 1, a2 \u003d 2 , ....., an \u003d n);\n另外再给出一个bi序列, 长度为n。记录ai中每个位置的数在每次操作后数值变化量的和。(详情看案例)\n两种操作:\n第一种: 将区间[l, r] 内的数字全部变成变成某一个数字。(如果ai \u003d\u003d x, 将ai变成y, 那么bi应该加上abs(x - y), 也就是改变量)\n第二种:询问区间[l, r]内bi的和。\n\u003cpre\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cpre\u003e\n输入两个整数n, m(1 ≤ n, m ≤ 1e5). 分别表示序列的长度和操作的次数\n如果是操作1, 那么输入四个整数, 1, l, r, y(1 ≤ l ≤ r ≤ n; 1 ≤ y≤ 1e8); 表示将[l, r]区间内的数变成y;\n如果是操作2, 那么输入三个整数, 2,l, r (1 ≤ l ≤ r ≤ n); 表示查询[l, r]范围内的bi的总和。\n\u003cpre\u003e"}},{"title":"Output","value":{"format":"HTML","content":"对于每个操作2, 每行输出一个数表示查询区间的bi总和。"}},{"title":"Examples","value":{"format":"HTML","content":"\u003cpre\u003e\nInput\n10 6\n1 1 5 3\n1 2 7 9\n1 10 10 11\n1 3 8 12\n1 1 10 3\n2 1 10\n\nOutput\n129\n\nInput\n3 4\n1 1 3 4\n2 1 1\n2 2 2\n2 3 3\n\nOutput\n3\n2\n1\n\u003cpre\u003e"}},{"title":"Note","value":{"format":"HTML","content":"\u003cpre\u003e\n样例一:\n初始时:a[1, 2, 3, 4, 5, 6, 7, 8, 9, 10], b[0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n第一次操作后:a[3, 3, 3, 3, 3, 6, 7, 8, 9, 10], b[2, 1, 0, 1, 2, 0, 0, 0, 0, 0];\n第二次操作后:a[3, 9, 9, 9, 9, 9, 9, 8, 9, 10], b[2, 7, 6, 7, 8, 3, 2, 0, 0, 0];\n第三次操作后:a[3, 9, 9, 9, 9, 9, 9, 8, 9, 11], b[2, 7, 6, 7, 8, 3, 2, 0, 0, 1];\n第四次操作后:a[3, 9, 12, 12, 12, 12, 12, 12, 9, 11], b[2, 7, 9, 10, 11, 6, 5, 4, 0, 1];\n第五次操作后:a[3, 3, 3, 3, 3, 3, 3, 3, 3, 3], b[2, 13, 18, 19, 20, 15, 14, 13, 6, 9];\n第六次操作: 询问结果为2 + 13 + 18 +19 +20 + 15 + 14 + 13 + 6 + 9 \u003d 129\n(口算了很久, 应该没错, 如果发现案例有点出入请群里指出)\n\u003cpre\u003e"}}]}