(CROC 2016 - Elimination Round (Rated Unofficial Edition))C. Enduring Exodus(二分)
2016-03-21 19:40
274 查看
C. Enduring Exodus
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
output
input
output
input
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 is2.
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.
房间为1表示不可以住,为0表示可以住。
然后A先生希望预定房间之后,他离最远的妹子最近,问你这个距离是多少。
check的时候,暴力枚举A先生住在哪儿就好了,然后用一个前缀和去维护一下。
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
2
input
5 1 01010
output
2
input
3 2000
output
1
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 is2.
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.
题意:
有n个房间,现在有农夫带着k个妹子来住酒店,每个人一个房间房间为1表示不可以住,为0表示可以住。
然后A先生希望预定房间之后,他离最远的妹子最近,问你这个距离是多少。
题解:
比较显然就是二分+O(n)去check。check的时候,暴力枚举A先生住在哪儿就好了,然后用一个前缀和去维护一下。
#include<bits/stdc++.h> using namespace std; const int maxn=1e5+7; int n,k; char s[maxn]; int sum[maxn]; bool check(int mid){ for(int i=1;i<=n;i++) { if(s[i]=='1')continue; int l = max(i-mid,1); int r = min(i+mid,n); if((sum[r]-sum[l-1]-1)>=k) return true; } return false; } int main() { cin>>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+100,ans = 0; //二分法 while(l<=r) { int mid = (l+r)/2; if(check(mid)){ r=mid-1,ans=mid; } else l=mid+1; } cout<<ans<<endl; }
相关文章推荐
- 终极结束进程方法API
- android自定义控件之底部自动切换Tab布局
- VS2013简单的单元测试
- thttpd源码分析
- HDOJ-2717-Catch That Cow【BFS】
- Java 泛型通配符?解惑
- JCE中支持AES,支持的模式和填充方式
- 第八讲--buffer cache大小的设置及依据
- IIS(3)
- IIS(2)
- HDU 2795
- java语言程序设计第十版(Introduce to java) 课后习题 chapter6-10
- hdu 5646DZY Loves Partition(构造)
- Hive相关资料整理
- Eclipse插件svn和TortoiseSvn版本对应关系
- hdu 5646DZY Loves Partition(构造)
- HDU 1896 Stones
- IIS(1)
- 字符串截取
- java语言程序设计第十版(Introduce to java) 课后习题 chapter6-6