Codeforces Round 288 (Div. 2)
C
Anya and Ghosts
Codeforces
1600
原题
← BD →
翻译中…

Anya loves to watch horror movies. In the best traditions of horror, she will be visited by $*m*$ ghosts tonight. Anya has lots of candles prepared for the visits, each candle can produce light for exactly $*t*$ seconds. It takes the girl one second to light one candle. More formally, Anya can spend one second to light one candle, then this candle burns for exactly $*t*$ seconds and then goes out and can no longer be used.

翻译中…

For each of the $*m*$ ghosts Anya knows the time at which it comes: the $*i*$-th visit will happen $*w*_{*i*}$ seconds after midnight, all $*w*_{*i*}$'s are distinct. Each visit lasts exactly one second.

翻译中…

What is the minimum number of candles Anya should use so that during each visit, at least $*r*$ candles are burning? Anya can start to light a candle at any time that is integer number of seconds from midnight, possibly, at the time before midnight. That means, she can start to light a candle integer number of seconds before midnight or integer number of seconds after a midnight, or in other words in any integer moment of time.

翻译中…

Input

翻译中…

The first line contains three integers $*m*$, $*t*$, $*r*$ ($1 ≤ *m*, *t*, *r* ≤ 300$), representing the number of ghosts to visit Anya, the duration of a candle's burning and the minimum number of candles that should burn during each visit.

翻译中…

The next line contains $*m*$ space-separated numbers $*w*_{*i*}$ ($1 ≤ *i* ≤ *m*$, $1 ≤ *w*_{*i*} ≤ 300$), the $*i*$-th of them repesents at what second after the midnight the $*i*$-th ghost will come. All $*w*_{*i*}$'s are distinct, they follow in the strictly increasing order.

翻译中…

Output

翻译中…

If it is possible to make at least $*r*$ candles burn during each visit, then print the minimum number of candles that Anya needs to light for that.

翻译中…

If that is impossible, print $- 1$.

翻译中…

Note

翻译中…

Anya can start lighting a candle in the same second with ghost visit. But this candle isn't counted as burning at this visit.

翻译中…

It takes exactly one second to light up a candle and only after that second this candle is considered burning; it means that if Anya starts lighting candle at moment x, candle is buring from second x + 1 to second x + t inclusively.

翻译中…

In the first sample test three candles are enough. For example, Anya can start lighting them at the $3$-rd, $5$-th and $7$-th seconds after the midnight.

翻译中…

In the second sample test one candle is enough. For example, Anya can start lighting it one second before the midnight.

翻译中…

In the third sample test the answer is $- 1$, since during each second at most one candle can burn but Anya needs three candles to light up the room at the moment when the ghost comes.

翻译中…

样例

Input #1
1 8 3
10
Output #1
3
InputCopy OutputCopy
Input #2
2 10 1
5 8
Output #2
1
InputCopy OutputCopy
Input #3
1 1 3
10
Output #3
-1
InputCopy OutputCopy
题目信息
题号
508C
时间限制
2 s
内存限制
256 MB
标签
构造
贪心

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