Codeforces Round #Pi (Div. 2) D. One-Dimensional Battle Ships 二分 stl应用

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的区间，直接用set保存当前分割的区间就可以了。总复杂度为n * logn

#define N 200050
#define M 200050
#define maxn 205
#define MOD 1000000000000000007

#define mem(a)  memset(a, 0, sizeof(a))

int k,len,m,n,pri[N],num;
set<pii> myset;
set<pii>::iterator it;
int main()
{
    while(S(n)!=EOF)
    {
        S2(k,len);
        S(m);
        pii tp = mp(1,n);
        myset.insert(tp);
        int ans = -1;
        num = (tp.second - tp.first + 2) / (len + 1);
        bool flag = true;
        FI(m){
            scan_d(pri[i]);
            if(flag){
                it = myset.lower_bound(mp(pri[i],n + 1));
                it --;
                pii p = *it;
                {
                    myset.erase(it);
                    num -= (p.second - p.first + 2) / (len + 1);
                    if(p.first  <= pri[i] - 1){
                        pii tp = mp(p.first,pri[i] - 1);
                        num += (tp.second - tp.first + 2) / (len + 1);
                        myset.insert(tp);
                    }
                    if(pri[i] + 1 <= p.second){
                        pii tp = mp(pri[i] + 1,p.second);
                        num += (tp.second - tp.first + 2) / (len + 1);
                        myset.insert(tp);
                    }
                    if(num < k){
                        ans = i + 1;
                        flag = false;
                    }
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}