QOJ.ac

QOJ

時間限制: 4 s 記憶體限制: 1024 MB 總分: 100

#6324. 扩展凸包

统计

给定整数 $N, K$ 以及三维空间中的 $N$ 个点 $(X_1, Y_1, Z_1), \dots, (X_N, Y_N, Z_N)$。

令 $V$ 为 $N$ 个点 $(KX_1, KY_1, KZ_1), \dots, (KX_N, KYN, KZN)$ 的凸包。计算包含在 $V$ 内部或边界上且坐标为整数的点的数量,结果对 $998244353$ 取模。

输入格式

输入通过标准输入给出,格式如下:

$N \ K$ $X_1 \ Y_1 \ Z_1$ $\vdots$ $X_N \ Y_N \ Z_N$

  • 输入中的所有值均为整数。
  • $4 \le N \le 100$
  • $1 \le K \le 10^{15}$
  • $-200 \le X_i, Y_i, Z_i \le 200 \ (1 \le i \le N)$
  • $(X_i, Y_i, Z_i) \neq (X_j, Y_j, Z_j) \ (1 \le i < j \le N)$
  • 不存在通过所有 $N$ 个点的平面。

输出格式

输出答案。

样例

样例输入 1

4 2
0 0 0
1 0 0
0 1 0
0 0 1

样例输出 1

10

样例输入 2

4 10000
0 0 0
1 0 0
0 1 0
0 0 1

样例输出 2

59878050

样例输入 3

8 314159265358979
5 -3 -3
-5 -3 -3
0 5 -3
0 0 10
4 2 6
-4 2 6
0 -5 6
0 0 -5

样例输出 3

152811018

说明

在第一个样例中,有 10 个点包含在 $V$ 的内部或边界上且坐标为整数:$(0, 0, 0), (1, 0, 0), (2, 0, 0), (0, 1, 0), (1, 1, 0), (0, 2, 0), (0, 0, 1), (1, 0, 1), (0, 1, 1), (0, 0, 2)$。

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.