Codeforces 508C Anya and Ghosts【贪心】

C. Anya and Ghosts

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 wi seconds after midnight, all wi'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 wi (1 ≤ i ≤ m, 1 ≤ wi ≤ 300), the i-th of them repesents at what second after the midnight the i-th ghost will come. All wi'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.

Examples

input

1 8 3
10

output

3

input

2 10 1
5 8

output

1

input

1 1 3
10

output

-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.

题目大意：给出n个鬼访问的时间，和每个蜡烛可以持续的时间，每次访问最少需要的点燃的蜡烛数。问一共最少需要几个蜡烛。

思路：

1、初始的时候可以先点好蜡烛。那么我们只需要判断m是否小于r就能够判断出-1的结果，如果m确实小于r，那么输出-1.

2、剩下的情况就是可以迎接鬼过来的情况，直接贪心思路即可，每一只鬼过来的时候，从那一刻向前扫，将不够数的情况补上就行。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
int a[5000];
int time[5000];
int main()
{
    int n,m,r,cont,output,flag;
    while(~scanf("%d%d%d",&n,&m,&r))
    {
        output=0,flag=0;
        memset(time,0,sizeof(time));
        memset(a,0,sizeof(a));
        for(int i=1;i<=n;i++)scanf("%d",&a[i]);
        if(m<r)
        {
            printf("-1\n");
            continue;
        }
        for(int i=1;i<=n;i++)
        {
            int cha=a[i]-a[0];
            cont=0;
            if(i==1)
            {
                output+=r;
                cha-=r;
                for(int j=1;j<=r;j++)
                {
                    time[j]=m-j+1;
                }
            }
            else
            {
                for(int j=1;j<=r;j++)
                {
                    if(time[j]==0)
                    {
                        cha-=r;
                        time[j]=m-cont;
                        cont++;output++;
                    }
                }
            }
            int tmp=a[i+1]-a[i];
            for(int j=1;j<=r;j++)
            {
                time[j]-=tmp;
                if(time[j]<0)time[j]=0;
            }
            //if(cha<-1)flag=1;
        }
        if(flag==1)printf("-1\n");
        else printf("%d\n",output);
    }
}