Universal Cup Judging System

Universal Cup

시간 제한: 2.0 s 메모리 제한: 1024 MB 총점: 100 해킹 가능 ✓
통계

给你一个长度为 $N$ 的正整数序列 $A = (A_1, A_2, \dots, A_N)$。

请判断是否存在满足以下所有条件的子集 $X, Y \subseteq \{1, 2, \dots, N\}$。如果存在这样的子集,请输出其中一个样例。

  • $0 < |X| = |Y|$
  • $X$ 和 $Y$ 作为集合是不同的
  • 设 $s_X = \sum_{x \in X} \frac{1}{A_x}$ 且 $s_Y = \sum_{y \in Y} \frac{1}{A_y}$。则 $|s_X - s_Y| \le 10^{-5}$ 成立。

输入格式

输入格式如下:

N
A1 A2 ... AN
  • 所有输入值均为整数。
  • $2 \le N \le 1000$
  • $1 \le A_i \le 10^5$

输出格式

如果不存在满足条件的子集 $X, Y$,则输出 No

如果存在,设 $M = |X| = |Y|$。将 $X$ 中的元素按升序排列为 $X_1, X_2, \dots, X_M$,将 $Y$ 中的元素按升序排列为 $Y_1, Y_2, \dots, Y_M$。按以下格式输出:

Yes
M
X1 X2 ... XM
Y1 Y2 ... YM

如果存在多个满足条件的数对 $X, Y$,输出其中任意一个即可。

样例

输入样例 1

10
31 41 59 26 53 58 97 93 23 84

输出样例 1

Yes
5
1 2 5 7 9
1 2 3 4 6

输入样例 2

7
2 3 5 7 11 13 17

输出样例 2

No

输入样例 3

8
123 456 789 314 159 265 271 828

输出样例 3

Yes
4
2 4 5 7
1 2 3 6

说明

在第一个样例中,$s_X = \frac{1}{31} + \frac{1}{59} = 0.04920721705\dots$ 且 $s_Y = \frac{1}{26} + \frac{1}{93} = 0.04921422663\dots$,因此 $|s_X - s_Y| \le 10^{-5}$ 成立。

Editorials

IDTypeStatusTitlePosted ByLast UpdatedActions
#1418EditorialOpen题解jiangly2026-04-05 16:32:52View

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.