QOJ.ac

QOJ

Limite de temps : 1 s Limite de mémoire : 512 MB Points totaux : 100 Hackable ✓

#4220. 连接点

Statistiques

圆周上有 $3n$ 个不同的点。每个点都被染成 $n$ 种颜色之一,使得每种颜色恰好出现三次。

你需要绘制 $n$ 条互不相交的弧,每条弧的端点位于给定的点上。对于这些弧,弧的两个端点必须颜色相同,且弧上不应包含其他颜色相同的点。

注意,你绘制的是弧,而不是弦。

求出符合条件的绘制方案数,对 $998\,244\,353$ 取模。

输入格式

第一行包含一个整数 $n$ ($1 \le n \le 200\,000$):颜色的数量。

下一行包含 $3n$ 个整数 $c_1, c_2, \dots, c_{3n}$ ($1 \le c_i \le n$):圆周上按顺时针顺序排列的第 $i$ 个点的颜色。

保证每种颜色恰好出现三次。

输出格式

输出一个整数:符合条件的绘制方案数,对 $998\,244\,353$ 取模。

样例

输入格式 1

3
1 1 1 2 2 2 3 3 3

输出格式 1

8

输入格式 2

2
1 1 2 2 1 2

输出格式 2

3

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.