Universal Cup Judging System

Universal Cup

Time Limit: 4.0 s Memory Limit: 1024 MB Total points: 100 Hackable ✓
Statistics

若 $xy$ 平面上的一个点集 $U$ 满足其内部不包含 $U$ 中的任何点,则称该点集 $U$ 为好集(good)。注意,空集也被视为好集。

给定 $xy$ 平面上的 $N$ 个不同点 $v_1, v_2, \dots, v_N$,其中点 $v_i$ 的坐标为 $(x_i, y_i)$。已知任意三点均不共线。

请计算满足 $S$ 和 $V \setminus S$ 均为好集的子集 $S \subseteq V = \{v_1, v_2, \dots, v_N\}$ 的数量。

输入格式

输入格式如下:

$N$ $x_1 \ y_1$ $x_2 \ y_2$ $\vdots$ $x_N \ y_N$

  • 所有输入值均为整数。
  • $1 \le N \le 40$
  • $|x_i|, |y_i| \le 10^6$
  • 当 $i \neq j$ 时,$(x_i, y_i) \neq (x_j, y_j)$
  • 任意三点均不共线。

输出格式

输出答案。

样例

样例输入 1

4
0 0
3 0
0 3
1 1

样例输出 1

14

样例输入 2

8
1 0
2 0
3 1
3 2
2 3
1 3
0 2
0 1

样例输出 2

256

样例输入 3

10
0 0
1 1
7 1
1 7
3 2
2 3
4 2
2 4
5 4
4 5

样例输出 3

0

说明

在第一个样例中,除了空集 $\emptyset$ 和全集 $V$ 之外,其余所有子集 $S$ 均满足条件。

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.