A11186 | Points, Lines and Ready-made Titles
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given $n$ distinct points on a plane with integral coordinates. For each point you can either draw a vertical line through it, draw a horizontal line through it, or do nothing.
You consider several coinciding straight lines as a single one. How many distinct pictures you can get? Print the answer modulo $10^{9}+7$ .
You consider several coinciding straight lines as a single one. How many distinct pictures you can get? Print the answer modulo $10^{9}+7$ .
输入格式
The first line contains single integer $n$ ( $1<=n<=10^{5}$ ) — the number of points.
$n$ lines follow. The ( $i+1$ )-th of these lines contains two integers $x_{i}$ , $y_{i}$ ( $-10^{9}<=x_{i},y_{i}<=10^{9}$ ) — coordinates of the $i$ -th point.
It is guaranteed that all points are distinct.
$n$ lines follow. The ( $i+1$ )-th of these lines contains two integers $x_{i}$ , $y_{i}$ ( $-10^{9}<=x_{i},y_{i}<=10^{9}$ ) — coordinates of the $i$ -th point.
It is guaranteed that all points are distinct.
输出格式
Print the number of possible distinct pictures modulo $10^{9}+7$ .
输入输出样例
输入 #1
4 1 1 1 2 2 1 2 2
输出 #1
16
输入 #2
2 -1 -1 0 1
输出 #2
9
In the first example there are two vertical and two horizontal lines passing through the points. You can get pictures with any subset of these lines. For example, you can get the picture containing all four lines in two ways (each segment represents a line containing it).
The first way:  The second way: In the second example you can work with two points independently. The number of pictures is $3^{2}=9$ .
The first way:  The second way: In the second example you can work with two points independently. The number of pictures is $3^{2}=9$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted