CodeForces 645C Enduring Exodus

69 阅读 0 评论 46 点赞

我是靠谱客的博主务实钢笔，最近开发中收集的这篇文章主要介绍CodeForces 645C Enduring Exodus，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

题意：有n个房间，现在有k只牛和你来住，其中0代表空闲，1代表已经有人了，求大家相距的距离的最大值要最小。

思路：最值最小或者最大问题，显然二分答案，然后直接暴力check即可

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 100001
#define LL long long
int cas=1,T;
int n,k;
char s[maxn];
int sum[maxn];
bool check(int m)
{
	for (int i = 1;i<=n;i++)
	{
		if (s[i]=='1')
			continue;
		int l = max(i-m,1);
		int r = min(i+m,n);
		if (sum[r]-sum[l-1]-1>=k)return true;
	}
	return false;
}
int main()
{
	scanf("%d%d",&n,&k);
	scanf("%s",s+1);
	for (int i = 1;i<=n;i++)
	{
		sum[i]=sum[i-1];
		if (s[i]=='0')
            sum[i]++;
	}
	int l = 0,r=n,ans=0;
	while (l<=r)
	{
		int m = (l+r)/2;
		if (check(m))
			r=m-1,ans=m;
		else
			l=m+1;
	}
	printf("%dn",ans);
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

Description

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.