A11963 | Covered Points Count
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given $n$ segments on a coordinate line; each endpoint of every segment has integer coordinates. Some segments can degenerate to points. Segments can intersect with each other, be nested in each other or even coincide.
Your task is the following: for every $k \in [1..n]$ , calculate the number of points with integer coordinates such that the number of segments that cover these points equals $k$ . A segment with endpoints $l_i$ and $r_i$ covers point $x$ if and only if $l_i \le x \le r_i$ .
Your task is the following: for every $k \in [1..n]$ , calculate the number of points with integer coordinates such that the number of segments that cover these points equals $k$ . A segment with endpoints $l_i$ and $r_i$ covers point $x$ if and only if $l_i \le x \le r_i$ .
输入格式
The first line of the input contains one integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ) — the number of segments.
The next $n$ lines contain segments. The $i$ -th line contains a pair of integers $l_i, r_i$ ( $0 \le l_i \le r_i \le 10^{18}$ ) — the endpoints of the $i$ -th segment.
The next $n$ lines contain segments. The $i$ -th line contains a pair of integers $l_i, r_i$ ( $0 \le l_i \le r_i \le 10^{18}$ ) — the endpoints of the $i$ -th segment.
输出格式
Print $n$ space separated integers $cnt_1, cnt_2, \dots, cnt_n$ , where $cnt_i$ is equal to the number of points such that the number of segments that cover these points equals to $i$ .
输入输出样例
输入 #1
3 0 3 1 3 3 8
输出 #1
6 2 1
输入 #2
3 1 3 2 4 5 7
输出 #2
5 2 0
The picture describing the first example:
Points 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.
The picture describing the second example:
Points $[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.
Points 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.
The picture describing the second example:
Points $[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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted