C. Anya and Ghosts（Codeforces Round #288 (Div. 2)）

最新推荐文章于 2021-10-09 17:04:48 发布

叶孤心丶

最新推荐文章于 2021-10-09 17:04:48 发布

阅读量829

点赞数

本文链接：https://blog.csdn.net/yeguxin/article/details/43239287

版权

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

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.

、

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

using namespace std;

struct node
{
    int x;
    int y;
}q[3010];

int a[3001];
int n,m,k;

int main()
{
    while(scanf("%d%d%d",&n,&m,&k)!=EOF)
    {
            memset(a,0,sizeof(a));
            memset(q,0,sizeof(q));
            for(int i=0;i<n;i++)
            {
                scanf("%d",&a[i]);
            }
            if(m<k)
            {
                printf("-1\n");
                continue;
            }
            int kk = m;
            int sum = 0;
            int flag = 0;
            for(int i=0;i<n;i++)
            {
                if(i == 0)
                {
                    sum = k;
                    for(int j=a[i]-k;j<a[i];j++)
                    {
                        q[j].y = 1;
                    }
                    for(int j=a[i];j<a[i]+m;j++)
                    {
                        q[j].x = kk;
                        kk--;
                    }
                }
                else
                {
                    if(q[a[i]].x < k)
                    {
                        //printf("q[%d].x = %d\n",a[i],q[a[i]].x);
                        int cnt = k - q[a[i]].x;
                        sum += cnt;
                        for(int j=a[i]-cnt;j<a[i];j++)
                        {
                            if(q[j].y == 1)
                            {
                                flag = 1;
                                break;
                            }
                            q[j].y = 1;
                            for(int v=j+1;v<m+j+1;v++)
                            {
                                q[v].x++;
                            }
                        }
                    }
                }
                if(flag == 1)
                {
                    break;
                }
            }
            if(flag == 1)
            {
                printf("-1\n");
            }
            else
            {
                printf("%d\n",sum);
            }

    }
    return 0;
}

→Judgement Protocol

叶孤心丶

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
打赏
0
评论
C. Anya and Ghosts（Codeforces Round #288 (Div. 2)）

C. Anya and Ghoststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnya loves to watch horror movies. In th
复制链接

扫一扫