codeforces 508 C. 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.

Sample test(s)

input

1 8 3
10

output

3

input

2 10 1
5 8

output

1

input

1 1 3
10

output

-1

题目大意：有m个鬼，分别到来的时间为第二行输入，有很多跟蜡烛，但是点燃一根蜡烛需要1s，蜡烛持续的时间为t，鬼到来的时候，亮着的蜡烛必须不少于r根，问你，最少需要多少根蜡烛。

思路：把每次点的蜡烛都存在一个Vis数组里面，vis里面存的是每个蜡烛点亮的时刻。最后vis数组的长度就是问题的解。

源代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <queue>

using namespace std;
#define maxn 305
#define inf 0x7ffffff
int arr[maxn];
int vis[maxn];
int n,t,r;
int main()
{
    scanf("%d%d%d",&n,&t,&r);
    memset(vis,0,sizeof(vis));
    for(int i = 0; i < n; i++){
        scanf("%d",&arr[i]);
    }
    if(t < r){
        printf("-1\n");
        return 0;
    }
    int cnt = 0;
    int ans = 0;
    for(int i = 0;i < n; i++){
        bool flag = false;
        int tmp = r;
        for(int j = ans - 1; j >= 0; j--){
            if(arr[i] - vis[j] <= t && tmp > 0){
                tmp --;
            }
        }
        for(int j = 0; j < tmp; j++){
            vis[ans] = arr[i] - (tmp - j);
            ans++;
        }
    }
    printf("%d\n",ans);
    return 0;
}