A9581 | Meta-universe
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Consider infinite grid of unit cells. Some of those cells are planets.
Meta-universe $M={p_{1},p_{2},...,p_{k}}$ is a set of planets. Suppose there is an infinite row or column with following two properties: 1) it doesn't contain any planet $p_{i}$ of meta-universe $M$ on it; 2) there are planets of $M$ located on both sides from this row or column. In this case we can turn the meta-universe $M$ into two non-empty meta-universes $M_{1}$ and $M_{2}$ containing planets that are located on respective sides of this row or column.
A meta-universe which can't be split using operation above is called a universe. We perform such operations until all meta-universes turn to universes.
Given positions of the planets in the original meta-universe, find the number of universes that are result of described process. It can be proved that each universe is uniquely identified not depending from order of splitting.
Meta-universe $M={p_{1},p_{2},...,p_{k}}$ is a set of planets. Suppose there is an infinite row or column with following two properties: 1) it doesn't contain any planet $p_{i}$ of meta-universe $M$ on it; 2) there are planets of $M$ located on both sides from this row or column. In this case we can turn the meta-universe $M$ into two non-empty meta-universes $M_{1}$ and $M_{2}$ containing planets that are located on respective sides of this row or column.
A meta-universe which can't be split using operation above is called a universe. We perform such operations until all meta-universes turn to universes.
Given positions of the planets in the original meta-universe, find the number of universes that are result of described process. It can be proved that each universe is uniquely identified not depending from order of splitting.
输入格式
Consider infinite grid of unit cells. Some of those cells are planets.
Meta-universe $M={p_{1},p_{2},...,p_{k}}$ is a set of planets. Suppose there is an infinite row or column with following two properties: 1) it doesn't contain any planet $p_{i}$ of meta-universe $M$ on it; 2) there are planets of $M$ located on both sides from this row or column. In this case we can turn the meta-universe $M$ into two non-empty meta-universes $M_{1}$ and $M_{2}$ containing planets that are located on respective sides of this row or column.
A meta-universe which can't be split using operation above is called a universe. We perform such operations until all meta-universes turn to universes.
Given positions of the planets in the original meta-universe, find the number of universes that are result of described process. It can be proved that each universe is uniquely identified not depending from order of splitting.
Meta-universe $M={p_{1},p_{2},...,p_{k}}$ is a set of planets. Suppose there is an infinite row or column with following two properties: 1) it doesn't contain any planet $p_{i}$ of meta-universe $M$ on it; 2) there are planets of $M$ located on both sides from this row or column. In this case we can turn the meta-universe $M$ into two non-empty meta-universes $M_{1}$ and $M_{2}$ containing planets that are located on respective sides of this row or column.
A meta-universe which can't be split using operation above is called a universe. We perform such operations until all meta-universes turn to universes.
Given positions of the planets in the original meta-universe, find the number of universes that are result of described process. It can be proved that each universe is uniquely identified not depending from order of splitting.
输出格式
Print the number of resulting universes.
输入输出样例
输入 #1
5 0 0 0 2 2 0 2 1 2 2
输出 #1
3
输入 #2
8 0 0 1 0 0 2 0 3 3 0 3 1 2 3 3 3
输出 #2
1
The following figure describes the first test case:


C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted