【CROC 2016 - Elimination RoundC】【二分】Enduring Exodus 最小的人看守与羊距离

最新推荐文章于 2021-02-28 17:01:57 发布

snowy_smile

最新推荐文章于 2021-02-28 17:01:57 发布

阅读量859

点赞数

分类专栏：题库-CF CodeForces 二分文章标签：题库-CF CodeForces 二分

本文链接：https://blog.csdn.net/snowy_smile/article/details/50930334

版权

题库-CF CodeForces 同时被 2 个专栏收录

280 篇文章

订阅专栏

二分

29 篇文章

订阅专栏

农场主约翰带着他的奶牛们旅行，并计划入住一家旅馆。他们需要找到连续的k+1个空闲房间，使得约翰与最远的奶牛之间的距离尽可能小。通过二分搜索来解决这一问题。

摘要由CSDN通过智能技术生成

In an attempt to escape the Mischievous Mess Makers' antics, Farmer John has abandoned his farm and is traveling to the other side of Bovinia. During the journey, he and his k cows have decided to stay at the luxurious Grand Moo-dapest Hotel. The hotel consists of nrooms located in a row, some of which are occupied.

Farmer John wants to book a set of k + 1 currently unoccupied rooms for him and his cows. He wants his cows to stay as safe as possible, so he wishes to minimize the maximum distance from his room to the room of his cow. The distance between rooms i and j is defined as |j - i|. Help Farmer John protect his cows by calculating this minimum possible distance.

Input

The first line of the input contains two integers n and k (1 ≤ k < n ≤ 100 000) — the number of rooms in the hotel and the number of cows travelling with Farmer John.

The second line contains a string of length n describing the rooms. The i-th character of the string will be '0' if the i-th room is free, and '1' if the i-th room is occupied. It is guaranteed that at least k + 1 characters of this string are '0', so there exists at least one possible choice of k + 1 rooms for Farmer John and his cows to stay in.

Output

Print the minimum possible distance between Farmer John's room and his farthest cow.

Examples

input

7 2
0100100

output

input

5 1
01010

output

input

3 2
000

output

Note

In the first sample, Farmer John can book room 3 for himself, and rooms 1 and 4 for his cows. The distance to the farthest cow is 2. Note that it is impossible to make this distance 1, as there is no block of three consecutive unoccupied rooms.

In the second sample, Farmer John can book room 1 for himself and room 3 for his single cow. The distance between him and his cow is 2.

In the third sample, Farmer John books all three available rooms, taking the middle room for himself so that both cows are next to him. His distance from the farthest cow is 1.

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }
const int N = 1e5+10, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
int n, k;
char s[N];
int sum[N];
int check(int p,int dis)
{
	int l = max(1, p - dis);
	int r = min(n, p + dis);
	return (sum[r] - sum[l - 1] - 1) >= k;
}
int main()
{
	while (~scanf("%d%d", &n,&k))
	{
		scanf("%s", s + 1);
		for (int i = 1; i <= n; ++i)sum[i] = sum[i - 1] + (s[i] == '0');
		int ans = n;
		for (int i = 1; i <= n; ++i)if (s[i] == '0')
		{
			int l = 1;
			int r = n;
			while (l < r)
			{
				int mid = (l + r) / 2;
				if (check(i,mid))r = mid;
				else l = mid + 1;
			}
			gmin(ans, l);
		}
		printf("%d\n", ans);
	}
	return 0;
}
/*
【trick&&吐槽】
最大的最小，往往是二分的标志

【题意】
有一个旅馆，房间有n（1e5）个，1代表有人住了，0代表空余。
我们需要住1个看守和k只羊。保证住得下。
问最优安排下，看守与羊最大距离的最小值是多少

【类型】
二分

【分析】
直接枚举人的位置，然后二分最大距离，检测是否住得下
这题也有set做法，稍微麻烦一些。

【时间复杂度&&优化】
O(nlogn)

*/