{"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":"MD","content":"给定 n 条在坐标轴上的线段,每个线段的端点都是整数。线段有可能退化成一个顶点(即线段两端点坐标相同)。n 条线段可能相交,包含或者重叠。\n\n你的任务是对于每个 k ∈ [1, n],计算被 k 条线段覆盖的坐标顶点的个数。\n\n对于一个左右端点为 l\u003csub\u003ei\u003c/sub\u003e,r\u003csub\u003ei\u003c/sub\u003e 的线段,它覆盖坐标点 x 当且仅当 l\u003csub\u003ei\u003c/sub\u003e \u0026le; x \u0026le; r\u003csub\u003ei\u003c/sub\u003e 。"}},{"title":"Input","value":{"format":"MD","content":"第一行为一个整数 n(1 \u0026le; n \u0026le; 200000),表示线段的数量。\n\n之后 n 行,每行两个整数 l\u003csub\u003ei\u003c/sub\u003e,r\u003csub\u003ei\u003c/sub\u003e (0 \u0026le; l\u003csub\u003ei\u003c/sub\u003e \u0026le; r\u003csub\u003ei\u003c/sub\u003e \u0026le; 10\u003csup\u003e18\u003c/sup\u003e),表示线段的左右端点。"}},{"title":"Output","value":{"format":"MD","content":"输出 n 个整数 cnt\u003csub\u003e1\u003c/sub\u003e , cnt\u003csub\u003e2\u003c/sub\u003e , ... , cnt\u003csub\u003en\u003c/sub\u003e ,其中 cnt\u003csub\u003ei\u003c/sub\u003e 表示 被 i 条线段覆盖了的坐标点的个数。"}},{"title":"Examples","value":{"format":"MD","content":"\u003cdiv class\u003d\"sample-test\"\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e3\u003cbr\u003e0 3\u003cbr\u003e1 3\u003cbr\u003e3 8\u003cbr\u003e\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003e6 2 1 \u003cbr\u003e\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e3\u003cbr\u003e1 3\u003cbr\u003e2 4\u003cbr\u003e5 7\u003cbr\u003e\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003e5 2 0 \u003cbr\u003e\u003c/pre\u003e\n \u003c/div\u003e\n\u003c/div\u003e"}},{"title":"Note","value":{"format":"MD","content":"\u003cp\u003eThe picture describing the first example:\u003c/p\u003e\n\u003cp\u003e\u003cimg class\u003d\"tex-graphics\" src\u003d\"CDN_BASE_URL/9e2db93c851be80e4482c4512ded4d6b?v\u003d1621623072\" style\u003d\"max-width: 100.0%;max-height: 100.0%;\"\u003e\u003c/p\u003e\n\u003cp\u003ePoints with coordinates $$$[0, 4, 5, 6, 7, 8]$$$ are covered by one segment, points $$$[1, 2]$$$ are covered by two segments and point $$$[3]$$$ is covered by three segments.\u003c/p\u003e\n\u003cp\u003eThe picture describing the second example:\u003c/p\u003e\n\u003cp\u003e\u003cimg class\u003d\"tex-graphics\" src\u003d\"CDN_BASE_URL/72749ba4487af2103e9394a986aa8173?v\u003d1621623072\" style\u003d\"max-width: 100.0%;max-height: 100.0%;\"\u003e\u003c/p\u003e\n\u003cp\u003ePoints $$$[1, 4, 5, 6, 7]$$$ are covered by one segment, points $$$[2, 3]$$$ are covered by two segments and there are no points covered by three segments.\u003c/p\u003e"}}]}