A10389 | Kay and Eternity
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Snow Queen told Kay to form a word "eternity" using pieces of ice. Kay is eager to deal with the task, because he will then become free, and Snow Queen will give him all the world and a pair of skates.
Behind the palace of the Snow Queen there is an infinite field consisting of cells. There are $n$ pieces of ice spread over the field, each piece occupying exactly one cell and no two pieces occupying the same cell. To estimate the difficulty of the task Kay looks at some squares of size $k×k$ cells, with corners located at the corners of the cells and sides parallel to coordinate axis and counts the number of pieces of the ice inside them.
This method gives an estimation of the difficulty of some part of the field. However, Kay also wants to estimate the total difficulty, so he came up with the following criteria: for each $x$ ( $1<=x<=n$ ) he wants to count the number of squares of size $k×k$ , such that there are exactly $x$ pieces of the ice inside.
Please, help Kay estimate the difficulty of the task given by the Snow Queen.
Behind the palace of the Snow Queen there is an infinite field consisting of cells. There are $n$ pieces of ice spread over the field, each piece occupying exactly one cell and no two pieces occupying the same cell. To estimate the difficulty of the task Kay looks at some squares of size $k×k$ cells, with corners located at the corners of the cells and sides parallel to coordinate axis and counts the number of pieces of the ice inside them.
This method gives an estimation of the difficulty of some part of the field. However, Kay also wants to estimate the total difficulty, so he came up with the following criteria: for each $x$ ( $1<=x<=n$ ) he wants to count the number of squares of size $k×k$ , such that there are exactly $x$ pieces of the ice inside.
Please, help Kay estimate the difficulty of the task given by the Snow Queen.
输入格式
The first line of the input contains two integers $n$ and $k$ ( $1<=n<=100000$ , $1<=k<=300$ ) — the number of pieces of the ice and the value $k$ , respectively. Each of the next $n$ lines contains two integers $x_{i}$ and $y_{i}$ ( $-10^{9}<=x_{i},y_{i}<=10^{9}$ ) — coordinates of the cell containing $i$ -th piece of the ice. It's guaranteed, that no two pieces of the ice occupy the same cell.
输出格式
Print $n$ integers: the number of squares of size $k×k$ containing exactly $1,2,...,n$ pieces of the ice.
输入输出样例
输入 #1
5 3 4 5 4 6 5 5 5 6 7 7
输出 #1
10 8 1 4 0
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted