codeforces 567D. One-Dimensional Battle Ships

D. One-Dimensional Battle Ships

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Alice and Bob love playing one-dimensional battle ships. They play on the field in the form of a line consisting of n square cells (that is, on a 1 × n table).

At the beginning of the game Alice puts k ships on the field without telling their positions to Bob. Each ship looks as a 1 × a rectangle (that is, it occupies a sequence of a consecutive squares of the field). The ships cannot intersect and even touch each other.

After that Bob makes a sequence of "shots". He names cells of the field and Alice either says that the cell is empty ("miss"), or that the cell belongs to some ship ("hit").

But here's the problem! Alice like to cheat. May be that is why she responds to each Bob's move with a "miss".

Help Bob catch Alice cheating — find Bob's first move, such that after it you can be sure that Alice cheated.

Input

The first line of the input contains three integers: n, k and a (1 ≤ n, k, a ≤ 2·105) — the size of the field, the number of the ships and the size of each ship. It is guaranteed that the n, k and a are such that you can put k ships of size a on the field, so that no two ships intersect or touch each other.

The second line contains integer m (1 ≤ m ≤ n) — the number of Bob's moves.

The third line contains m distinct integers x1, x2, ..., xm, where xi is the number of the cell where Bob made the i-th shot. The cells are numbered from left to right from 1 to n.

Output

Print a single integer — the number of such Bob's first move, after which you can be sure that Alice lied. Bob's moves are numbered from1 to m in the order the were made. If the sought move doesn't exist, then print "-1".

Sample test(s)

input

11 3 3
5
4 8 6 1 11

output

3

input

5 1 3
2
1 5

output

-1

input

5 1 3
1
3

output

1

题目大意是给你k个长度为a的船，以及一个长度为n的区域，船不能相邻或相交，再给你m个指令，每次的指令都是一个位置，这个位置不能有船，输出到哪个位置一定会有船，如果可以都不碰到船，输出-1.

如果只是判断是否一定会碰到船，那就是一个O（n）的暴力，那么算法就很显然了，二分答案加o（n）暴力

zyf大神提供另一个做法（同时与出题人想法一致），对于(l,r) x是我下一步要走的点，然后把区间分为（l,x-1) (x+1,r),判断是否船能放进去，不能放就输出x。

比如一个全空的区间(l,r) ，这个区间能放的数目是（r-l+3）/（a+1），用个set维护一下所有的区间，枚举每次shoot的点，比如这个点x在（l，r）区间那么，你就从这个区间删除这个点，再加入（l，x-1），（x+1，r）统计一下ship数

#include<cstdlib>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
#define maxn 1100000
using namespace std;
int bb[maxn],a[maxn],n,m,k,aa;
bool check(int x){
	int size=0,ans=0;
	for(int i=1;i<=n;i++){
		size++;
		if(bb[i]<=x&&bb[i])size=0;
		if(size>=aa){
			size=-1;
			ans++;
		}
	}
//	printf("%d %d \n",x,ans);
	return ans>=k; 
}
int main(){
	scanf("%d%d%d%d",&n,&k,&aa,&m);
	for(int i=1;i<=m;i++){
		scanf("%d",&a[i]);
		bb[a[i]]=i;
	}
	int l=1,r=m;
	while(l<=r){
		int mid=(l+r)>>1;
	//	printf("%d %d %d %d\n",check(mid),l,r,mid);
		if(check(mid))l=mid+1;
		else r=mid-1;
	}
	if(l<=m)printf("%d\n",l);else puts("-1");
	return 0;
}