QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 256 MB Total points: 100

#889. 漫遊

Statistics

Rikka 是一位才華洋溢的學生。

她喜歡在解 ICPC 題目的同時在走廊上漫步。具體來說,她會進行 $n$ 步的隨機漫步。在第 $i$ 次隨機漫步中,她會以相等的機率選擇一個向量 $(x, y)$,其中 $x, y \in \mathbb{R}$ 且滿足 $x^2 + y^2 \le R_i^2$。接著她會沿著該向量移動。換句話說,如果她在隨機漫步前位於 $(A, B)$,那麼漫步後她會位於 $(A + x, B + y)$。在漫步開始前,她位於門口 $(0, 0)$。

漫步結束後,她對到點 $(0, 0)$ 的歐幾里得距離平方的期望值感到好奇。換句話說,她想知道在經過所有 $n$ 次隨機漫步後,若她位於 $(x, y)$,則 $x^2 + y^2$ 的期望值為何。

輸入格式

第一行包含一個整數 $n$,代表隨機漫步的步數。 第二行包含 $n$ 個正整數 $R_i$,代表第 $i$ 次隨機漫步的參數。

保證 $1 \le n \le 50\,000$ 且 $1 \le R_i \le 1000$。

輸出格式

你需要輸出 $d$,即 $x^2 + y^2$ 的期望值。假設正確結果為 $d^*$,你需要確保滿足 $\frac{|d - d^*|}{\max\{d^*, 1\}} \le 10^{-6}$。

範例

輸入 1

3
1 2 3

輸出 1

7.000000000000000

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.