Codeforces Round 456 (Div. 2)
D
Fishes
Codeforces
2100
原题
← CE →
翻译中…

While Grisha was celebrating New Year with Ded Moroz, Misha gifted Sasha a small rectangular pond of size $*n* × *m*$, divided into cells of size $1 × 1$, inhabited by tiny evil fishes (no more than one fish per cell, otherwise they'll strife!).

翻译中…

The gift bundle also includes a square scoop of size $*r* × *r*$, designed for fishing. If the lower-left corner of the scoop-net is located at cell $(*x*, *y*)$, all fishes inside the square $(*x*, *y*)...(*x* + *r* - 1, *y* + *r* - 1)$ get caught. Note that the scoop-net should lie completely inside the pond when used.

翻译中…

Unfortunately, Sasha is not that skilled in fishing and hence throws the scoop randomly. In order to not frustrate Sasha, Misha decided to release $*k*$ fishes into the empty pond in such a way that the expected value of the number of caught fishes is as high as possible. Help Misha! In other words, put $*k*$ fishes in the pond into distinct cells in such a way that when the scoop-net is placed into a random position among $(*n* - *r* + 1)·(*m* - *r* + 1)$ possible positions, the average number of caught fishes is as high as possible.

翻译中…

Input

翻译中…

The only line contains four integers $*n*, *m*, *r*, *k*$ ($1 ≤ *n*, *m* ≤ 10^{5}$, $1 ≤ *r* ≤ *min*(*n*, *m*)$, $1 ≤ *k* ≤ *min*(*n*·*m*, 10^{5})$).

翻译中…

Output

翻译中…

Print a single number — the maximum possible expected number of caught fishes.

翻译中…

You answer is considered correct, is its absolute or relative error does not exceed $10^{ - 9}$. Namely, let your answer be $*a*$, and the jury's answer be $*b*$. Your answer is considered correct, if image.

翻译中…

Note

翻译中…

In the first example you can put the fishes in cells $(2, 1)$, $(2, 2)$, $(2, 3)$. In this case, for any of four possible positions of the scoop-net (highlighted with light green), the number of fishes inside is equal to two, and so is the expected value.

翻译中…

image

翻译中…

样例

Input #1
3 3 2 3
Output #1
2.0000000000
InputCopy OutputCopy
Input #2
12 17 9 40
Output #2
32.8333333333
InputCopy OutputCopy
题目信息
题号
912D
时间限制
1 s
内存限制
256 MB
标签
数据结构
图论
贪心
概率论
最短路

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