任意门:http://codeforces.com/contest/1066/problem/B

B. Heaters
time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vova's house is an array consisting of nn elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The ii-th element of the array is 11 if there is a heater in the position ii, otherwise the ii-th element of the array is 00.

Each heater has a value rr (rr is the same for all heaters). This value means that the heater at the position pospos can warm up all the elements in range [pos−r+1;pos+r−1][pos−r+1;pos+r−1].

Vova likes to walk through his house while he thinks, and he hates cold positions of his house. Vova wants to switch some of his heaters on in such a way that each element of his house will be warmed up by at least one heater.

Vova's target is to warm up the whole house (all the elements of the array), i.e. if n=6n=6, r=2r=2 and heaters are at positions 22 and 55, then Vova can warm up the whole house if he switches all the heaters in the house on (then the first 33 elements will be warmed up by the first heater and the last 33 elements will be warmed up by the second heater).

Initially, all the heaters are off.

But from the other hand, Vova didn't like to pay much for the electricity. So he wants to switch the minimum number of heaters on in such a way that each element of his house is warmed up by at least one heater.

Your task is to find this number of heaters or say that it is impossible to warm up the whole house.

Input

The first line of the input contains two integers nn and rr (1≤n,r≤10001≤n,r≤1000) — the number of elements in the array and the value of heaters.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (0≤ai≤10≤ai≤1) — the Vova's house description.

Output

Print one integer — the minimum number of heaters needed to warm up the whole house or -1 if it is impossible to do it.

Examples
input

Copy
6 2
0 1 1 0 0 1
output

Copy
3
input

Copy
5 3
1 0 0 0 1
output

Copy
2
input

Copy
5 10
0 0 0 0 0
output

Copy
-1
input

Copy
10 3
0 0 1 1 0 1 0 0 0 1
output

Copy
3
Note

In the first example the heater at the position 22 warms up elements [1;3][1;3], the heater at the position 33 warms up elements [2,4][2,4] and the heater at the position 66 warms up elements [5;6][5;6] so the answer is 33.

In the second example the heater at the position 11 warms up elements [1;3][1;3] and the heater at the position 55 warms up elements [3;5][3;5] so the answer is 22.

In the third example there are no heaters so the answer is -1.

In the fourth example the heater at the position 33 warms up elements [1;5][1;5], the heater at the position 66 warms up elements [4;8][4;8] and the heater at the position 1010 warms up elements [8;10][8;10] so the answer is 33.

题意概括:

N 个房间,标记为 1 的房间有加热器,加热范围 【 i-r+1, i+r-1】;求使用最少的加热器加热所有房间。

解题思路:

这个贪心并不难想,顺序遍历,尽可能的扩展右端点。

但wa了好多发,主要是区间连接的细节问题。

ans_ed 为已覆盖集合的最右端的下一个。

看代码吧,心好凉。

AC code:

 #include <bits/stdc++.h>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int MAXN = 1e3+; int a[MAXN], l[MAXN], r[MAXN], cnt;
int ans_ed, now_st, now_ed; //当前已选集合能覆盖的最右端的下一个!!!下标!!!,当前结点能覆盖的左端,当前结点能覆盖的右端
int pre_index, now_index; //前一个可加的下标,当前可加的下标
int N, R;
int ans;
bool chch; int main()
{
scanf("%d%d", &N, &R);
bool flag = true;
cnt = ;
for(int i = ; i <= N; i++){
scanf("%d", &a[i]);
if(a[i] == ){
flag = false;
//nxt[++cnt] = i;
cnt++;
l[cnt] = i-R+; //当前可加热的左端
r[cnt] = i+R-; //当前可加热的右端
}
}
//see see
//for(int i = 1; i <= cnt; i++) printf("%d ", nxt[i]);
//puts("");
if(flag) printf("-1\n"); //没有加热器
else{
chch = false;
ans = ;
ans_ed = ; //答案最右端初始化为1
int k = ; //从头开始顺序遍历加热器
bool book = false;
do{
if(l[k] < ans_ed) //当前加热器k可连接前一个加热区,说明该点可用
{
book = true; //标记有保留考虑项
pre_index = k; //记录当前下标
k++; //讨论下一个,如果下一个可加,则当前这个不加
if(k == cnt+){ //如果当前这个为最后一个
if(ans_ed < N+){ //当前未全覆盖
ans++;
ans_ed = r[k-]+; //注意加1
}
}
continue;
} if(book){ //说明前一个可选,但是未选
if(l[k] > ans_ed){ //当前这个不可以加,说明上一个要加
now_index = pre_index;
}
else now_index = k; //当前这个可加
ans++;
ans_ed = r[now_index]+;
if(now_index == pre_index) --k;
book = false;
}
else if(l[k] > ans_ed) //当前加热器不能连接前一个加热区,说明出现断层,但是是顺序遍历下来的,说明无解
{
chch = true;break;
}
else{ //无缝连接,选!
ans++; //答案加一
ans_ed = r[k]+; //更新集合最右端
}
k++; //讨论下一个;
}while(k <= cnt);
if(ans_ed <= N || ans == ) chch = true;
if(chch) printf("-1\n");
else printf("%d\n", ans);
}
return ;
}

Codeforces Round #515 (Div. 3) B. Heaters【 贪心 区间合并细节 】的更多相关文章

  1. Codeforces Round #515 (Div. 3) B. Heaters (贪心)

    题意:有\(n\)个桩子,\(1\)表示该位置有一个火炉,可以使两边距离为\(r\)的范围照亮,问最少使用多少炉子使得所有范围都被照亮. 题解:贪心,首先我们从\(r\)位置开始向左找,如果找到了就记 ...

  2. CodeForces Round #515 Div.3 B. Heaters

    http://codeforces.com/contest/1066/problem/B Vova's house is an array consisting of nn elements (yea ...

  3. Codeforces Round #515 (Div. 3)

    Codeforces Round #515 (Div. 3) #include<bits/stdc++.h> #include<iostream> #include<cs ...

  4. B. Heaters ( Codeforces Round #515 (Div. 3) )

    题解:对于每个点 i 来说,从 j = i + r - 1 开始往前找,如果找到一个 a [ j ] 是 1 ,那么就把它选上,但是我们需要判断交界处,也就是如果前面选的那个可以让这个点变温暖,就不用 ...

  5. Codeforces Round #515 (Div. 3) 解题报告(A~E)

    题目链接:http://codeforces.com/contest/1066 1066 A. Vova and Train 题意:Vova想坐火车从1点到L点,在路上v的整数倍的点上分布着灯笼,而在 ...

  6. Codeforces Round #202 (Div. 1) A. Mafia 贪心

    A. Mafia Time Limit: 20 Sec  Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/348/problem/A D ...

  7. Codeforces Round #382 (Div. 2)B. Urbanization 贪心

    B. Urbanization 题目链接 http://codeforces.com/contest/735/problem/B 题面 Local authorities have heard a l ...

  8. Codeforces Round #164 (Div. 2) E. Playlist 贪心+概率dp

    题目链接: http://codeforces.com/problemset/problem/268/E E. Playlist time limit per test 1 secondmemory ...

  9. Codeforces Round #180 (Div. 2) B. Sail 贪心

    B. Sail 题目连接: http://www.codeforces.com/contest/298/problem/B Description The polar bears are going ...

随机推荐

  1. Android代码中实现WAP方式联网

    无论是移动.联通还是电信,都至少提供了两种类型的的APN:WAP方式和NET方式.其中NET方式跟WIFI方式一样,无需任何设置,可自由访问所有类型网站,而WAP方式,需要手机先设置代理服务器和端口号 ...

  2. elasticSearch请求流程图

  3. Myeclipse编辑JSP文件时,可以点击重口顶部的箭头来切换全屏状态

  4. Scala安装及开发环境搭建

    最近想学习下scala,为后面转大数据做一些沉淀. 1. 首先保证jdk已经成功安装 2. 去官网下载scala安装程序 http://www.scala-lang.org/download/all. ...

  5. FZU 2122——又见LKity——————【字符串匹配、暴力】

    Problem 2122 又见LKity Accept: 407    Submit: 1413Time Limit: 1000 mSec    Memory Limit : 32768 KB  Pr ...

  6. newInstance和new的区别(good)

    从JVM 的角度看,我们使用关键字new创建一个类的时候,这个类可以没有被加载.但是使用newInstance()方法的时候,就必须保证:1.这个 类已经加载:2.这个类已经连接了.而完成上面两个步骤 ...

  7. Hashtable语法简介

    Hashtable简述 Hashtable是System.Collections命名空间提供的一个容器 Hashtable中keyvalue键值对均为object类型,所以Hashtable可以支持任 ...

  8. C# 创建一个WCF服务

    做代码统计,方便以后使用: app.config配置文件设置: <configuration> <system.serviceModel> <bindings> & ...

  9. c#.net常见字符串处理方法

    1.字符串比较 字符串.ComparTo(目标字符串) "a".ComparTo("b"); 2.查找子串 字符串.IndexOf(子串,查找其实位置) ; 字 ...

  10. for循环的几种比较

    对一个集合遍历的3种方法:1.for(int i=0;i<list.size();i++) 2.for(int i=0,len=list.size();i<len;i++) 3.for ( ...