#P15641. [ICPC 2022 Tehran R] Dominoes

[ICPC 2022 Tehran R] Dominoes

Problem Description

:::align{right} :::

Pixar is gearing up to introduce its next animated film, Elemental, at the 2023 Cannes Film Festival. But one of the scenes needs re-rendering. In this scene, there are nn dominoes in a straight line, and one of them is supposed to fall and drop a number of subsequent dominoes in a domino-like manner. Considering it is less than 1 month away from the 2023 Cannes Film Festival, Pixar asked you to write a program that calculates the cost of re-rendering the scene for nn initial domino choices.

To simplify the calculations, we assume that the dominoes are displayed from the side like line segments with no width on the coordinate axis, and they fall to the left. They are numbered from left to right and domino ii has height lil_{i} and is located at xix_{i}. The cost of re-rendering this scene is equal to the area of the moving part of the scene, i.e. the union area of quarter circles of dropped dominoes. Note that domino falling areas may overlap, and the overlapped area should be calculated only once. The picture illustrates the falling of dominoes in the first sample test, when the initial domino choice for falling is the domino number 5.

Input Format

The first line of input contains a positive integer nn, indicating the number of dominoes. The next nn lines, each consists of a pair of integers, xix_{i} and lil_{i}, indicating the location and the height of the domino number ii. It is guaranteed that n200,000n \leqslant 200,000 and 1xi,li1091 \leqslant x_{i}, l_{i} \leqslant 10^{9}. Dominoes are given from left to right; i.e. xi<xi+1x_{i} < x_{i+1}.

Output Format

Output nn lines, where the ii-th contains the cost of re-rendering the scene with ii-th domino as the initial falling domino. All numbers must have an absolute or relative error of at most 10610^{-6}.

7
2 2
5 3
9 5
12 1
13 5
14 2
16 3
3.141592654
7.068583471
24.659773696
0.785398163
42.250963921
44.164186876
49.714124052