Universal Cup Judging System

Universal Cup

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

給你一個長度為 $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题解jianglyView

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.