Yandex.Algorithm 2011: Qualification 2
E
Corridor
Codeforces
2600
原题
← D→
翻译中…

Consider a house plan.

翻译中…

Let the house be represented by an infinite horizontal strip defined by the inequality $- *h* ≤ *y* ≤ *h*$. Strictly outside the house there are two light sources at the points $(0, *f*)$ and $(0,  - *f*)$. Windows are located in the walls, the windows are represented by segments on the lines $*y* = *h*$ and $*y* =  - *h*$. Also, the windows are arranged symmetrically about the line $*y* = 0$.

翻译中…

Your task is to find the area of the floor at the home, which will be lighted by the sources of light.

翻译中…

image

翻译中…

Input

翻译中…

The first line of the input file contains three integers $*n*$, $*h*$ and $*f*$ ($1 ≤ *n* ≤ 500$, $1 ≤ *h* ≤ 10$, $*h* < *f* ≤ 1000$). Next, $*n*$ lines contain two integers each $*l*_{*i*}$, $*r*_{*i*}$ ($- 5000 ≤ *l*_{*i*} < *r*_{*i*} ≤ 5000$), each entry indicates two segments. Endpoints of the first segment are $(*l*_{*i*}, *h*)$-$(*r*_{*i*}, *h*)$, and endpoints of the second segment are $(*l*_{*i*},  - *h*)$-$(*r*_{*i*},  - *h*)$. These segments describe location of windows. Numbers in the lines are space-separated. It is guaranteed that no two distinct segments have common points.

翻译中…

Output

翻译中…

Print the single real number — the area of the illuminated part of the floor with an absolute or relative error of no more than $10^{ - 4}$.

翻译中…

Note

翻译中…

The second sample test is shown on the figure. Green area is the desired area of the illuminated part of the floor. Violet segments indicate windows.

翻译中…

样例

Input #1
1 1 2
-1 1
Output #1
10.0000000000
InputCopy OutputCopy
Input #2
2 2 4
-1 0
1 2
Output #2
23.3333333333
InputCopy OutputCopy
题目信息
题号
82E
时间限制
2 s
内存限制
256 MB
标签
计算几何

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。