Codeforces Round 115
E
Power Defence
Codeforces
2600
原题
← DF →
翻译中…

Vasya plays the Power Defence.

翻译中…

He must pass the last level of the game. In order to do this he must kill the Main Villain, who moves in a straight line at speed 1 meter per second from the point $( - ∞, 0)$ to the point $( + ∞, 0)$ of the game world. In the points $(*x*, 1)$ and $(*x*,  - 1)$, where $*x*$ is an integer number, Vasya can build towers of three types: fire-tower, electric-tower or freezing-tower. However, it is not allowed to build two towers at the same point. Towers of each type have a certain action radius and the value of damage per second (except freezing-tower). If at some point the Main Villain is in the range of action of $*k*$ freezing towers then his speed is decreased by $*k* + 1$ times.

翻译中…

The allowed number of towers of each type is known. It is necessary to determine the maximum possible damage we can inflict on the Main Villain.

翻译中…

All distances in the problem are given in meters. The size of the Main Villain and the towers are so small, that they can be considered as points on the plane. The Main Villain is in the action radius of a tower if the distance between him and tower is less than or equal to the action radius of the tower.

翻译中…

Input

翻译中…

The first line contains three integer numbers $*nf*, *ne*$ and $*ns*$ — the maximum number of fire-towers, electric-towers and freezing-towers that can be built $(0 ≤ *nf*, *ne*, *ns* ≤ 20, 1 ≤ *nf* + *ne* + *ns* ≤ 20)$. The numbers are separated with single spaces.

翻译中…

The second line contains three integer numbers $*rf*, *re*$ and $*rs*$ $(1 ≤ *rf*, *re*, *rs* ≤ 1000)$ — the action radii of fire-towers, electric-towers and freezing-towers. The numbers are separated with single spaces.

翻译中…

The third line contains two integer numbers $*df*$ and $*de*$ $(1 ≤ *df*, *de* ≤ 1000)$ — the damage a fire-tower and an electronic-tower can inflict on the Main Villain per second (in the case when the Main Villain is in the action radius of the tower). The numbers are separated with single space.

翻译中…

Output

翻译中…

Print the only real number — the maximum possible damage to the Main Villain with absolute or relative error not more than $10^{ - 6}$.

翻译中…

Note

翻译中…

In the first sample we've got one fire-tower that always inflicts the same damage, independently of its position.

翻译中…

In the second sample we've got another freezing-tower of the same action radius. If we build the two towers opposite each other, then the Main Villain's speed will be two times lower, whenever he enters the fire-tower's action radius. That means that the enemy will be inflicted with twice more damage.

翻译中…

样例

Input #1
1 0 0
10 10 10
100 100
Output #1
1989.97487421
InputCopy OutputCopy
Input #2
1 0 1
10 10 10
100 100
Output #2
3979.94974843
InputCopy OutputCopy
题目信息
题号
175E
时间限制
3 s
内存限制
256 MB
标签
暴力
动态规划
计算几何
贪心

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