【set+指针】One-Dimensional Battle Ships

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

Copy

11 3 3
5
4 8 6 1 11

output

Copy

3

input

Copy

5 1 3
2
1 5

output

Copy

-1

input

Copy

5 1 3
1
3

output

Copy

1

题目大意：

在一维坐标系上，长度为n，一共放置有k条船，每条船的长度为a，每条船之间的距离至少相隔1个单位长度

有m次询问，每一次对方回答都是miss，也就是该区域没有船

问什么时候可以判断出对方撒谎了

思路：

set保存一下每一次询问的位置，之后找到该位置左侧和右侧最近的一次询问，查询该区间可以放置多少船，如果当前总区间不能满足k条船的时候，输出答案

#include<bits/stdc++.h>
using namespace std;
int a[200005];
set<int>s;
int n,k,size;
set<int>::iterator it,temp_it;
int deal(int l,int r){
    if(l>r)
        return 0;
    int t=(r-l+1)/(size+1);
    int remain=(r-l+1)-t*(size+1);
    if(remain>=size)
        t++;
    return t;
}
map<pair<int,int>,int>mp;
int main(){
    mp.clear();
    scanf("%d%d%d",&n,&k,&size);
    mp[make_pair(1,n)]=k;
    int num;
    scanf("%d",&num);
    s.clear();
    bool judge=false;
    int now=n;
    int tttt=deal(1,n);
    for(int i=1;i<=num;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<=num;i++){
        s.insert(a[i]);
        temp_it=it=s.find(a[i]);
        int left,right;
        int num1,num2;
        if(it==s.begin()){
            num1=deal(1,(*it)-1);
            left=1;
        }
        else{
            it--;
            num1=deal((*it)+1,a[i]-1);
            left=(*it)+1;
        }
        it=temp_it;
        it++;
        if(it==s.end()){
            num2=deal(a[i]+1,n);
            right=n;
        }
        else{
            num2=deal((*temp_it)+1,(*it)-1);
            right=(*it)-1;
        }
        int ttt=deal(left,right);
        if(tttt-ttt+num1+num2>=k){
            tttt=tttt-ttt+num1+num2;
            continue;
        }
        else{
            printf("%d\n",i);
            judge=true;
            break;
        }
    }
    if(!judge){
        printf("-1\n");
    }
    int aaa;
    cin>>aaa;
}
// 5 1 2
// 3
// 3 1 2