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 from 1 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，船摆放时不能重叠也不能相邻。共打了m发炮弹，问第几发一定能打到船

思路：二分炮弹发数，看地图上剩下的空格长度是否能放下a艘船

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <cstring>
#include <queue>
#include <algorithm>
#define ll long long
#define max_ 100100
#define les 1e-6
#define inf 0x3f3f3f3f
using namespace std;
int m,n,k,a;
int num[200100];
vector<int>v;
bool check(int x)
{
    v.clear();
    for(int i=1;i<=x;i++)
    v.push_back(num[i]);
    v.push_back(n+1);
    v.push_back(0);
    sort(v.begin(),v.end());
    int pre=1,cnt=0;
    for(int i=0;i<v.size()-1;i++)
    {
        cnt+=(v[i+1]-v[i])/(a+1);
    }
    if(cnt>=k)
    return false;
    return true;
}
int main(int argc, char const *argv[]) {
    scanf("%d%d%d",&n,&k,&a);
    scanf("%d",&m);
    for(int i=1;i<=m;i++)
    scanf("%d",&num[i]);
    int l=1,r=m,ans=inf;
    while(l<=r)
    {
        int mid=(l+r)>>1;
        if(check(mid))
        {
            r=mid-1;
            ans=mid;
        }
        else
        l=mid+1;
    }
    if(ans==inf)
    printf("-1\n" );
    else
    printf("%d\n",ans );
    return 0;
}