【打CF，学算法——三星级】CodeForces 567D One-Dimensional Battle Ships (二分)

【CF简介】

提交链接：CF 567D

题面：

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 ofn 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 a1 × a rectangle (that is, it occupies a sequence ofa 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·10⁵) — 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 putk 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 integersx₁, x₂, ..., x_m, wherex_i is the number of the cell where Bob made thei-th shot. The cells are numbered from left to right from1 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".

Examples

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

题意：

     一个1*n的长条上，间隔地放置着k艘长度为a的船，Bob会炮击m个不同的位置，每次Alice都会告诉Bob是否击中。但Alice会撒谎，击中了说没击中，问最少用几步可以发现Alice说谎，不能抓住Alice撒谎则输出-1。

解题：

     比较明显的是Bob问的次数越多，Alice就越容易被抓住，故而呈单调性，可以二分问的次数，随后检验该次数下的结果，得出结果。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int x[200010],arr[200010];
int main()
{
    int m,n,k,a,le,ri,cnt,p,tmp;
	bool flag=0;
	scanf("%d%d%d",&n,&k,&a);
	scanf("%d",&m);
	for(int i=1;i<=m;i++)
		scanf("%d",&x[i]);
	le=1,ri=m;
    while(le<=ri)
	{
		cnt=0;
		tmp=0;
		int mid=(le+ri)>>1;
		arr[cnt++]=0;
		for(int i=1;i<=mid;i++)
			arr[cnt++]=x[i];
        sort(arr,arr+cnt);
		arr[cnt++]=n+1;
		for(int i=0;i<cnt-1;i++)
			tmp+=(arr[i+1]-arr[i])/(a+1);
        if(tmp>=k)
			le=mid+1;
		else
		{
			flag=1;
			ri=mid-1;
		}
	}
	if(flag)
		printf("%d\n",ri+1);
	else
		printf("-1\n");
	return 0;
}