Codeforces Round #Pi (Div. 2) D. One-Dimensional Battle Ships set乱搞

D. One-Dimensional Battle Ships
Time Limit: 2 Sec

Memory Limit: 256 MB

题目连接

http://codeforces.com/contest/567/problem/D

Description

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 Input

11 3 3
5
4 8 6 1 11

Sample Output

HINT

题意

在一维区间上，每次击打一个长度为1的区间，问在第几次（<=m）不能放这k*a的船，注意船与船不相互接触；

不存在输出-1；

题解：

set寻找相邻x端点维护值判断下就好了

代码

 1 #include <cstdio>
 2 #include <cmath>
 3 #include <cstring>
 4 #include <ctime>
 5 #include <iostream>
 6 #include <algorithm>
 7 #include <set>
 8 #include <vector>
 9 #include <queue>
10 #include <typeinfo>
11 #include <map>
12 #include <stack>
13 typedef __int64 ll;
14 #define inf 1000000000000
15 using namespace std;
16 inline ll read()
17 {
18     ll x=0,f=1;
19     char ch=getchar();
20     while(ch<'0'||ch>'9')
21     {
22         if(ch=='-')f=-1;
23         ch=getchar();
24     }
25     while(ch>='0'&&ch<='9')
26     {
27         x=x*10+ch-'0';
28         ch=getchar();
29     }
30     return x*f;
31 }
32 
33 //**************************************************************************************
34 
35 set<int >s;
36 set<int >::iterator it,itt;
37 int n,k,a;
38 int sum;
39 bool test(int x)
40 {
41     it=s.lower_bound(x);
42     int r=*it;
43     int l=*(--it);
44     sum-=(r-l)/(a+1);
45     sum+=((x-l)/(a+1)+(r-x)/(a+1));
46     if(sum<k)return true;
47     else return false;
48 }
49 int main()
50 {
51     scanf("%d%d%d",&n,&k,&a);
52     int m;
53     scanf("%d",&m);
54     s.insert(0);
55     s.insert(n+1);
56     int x;
57     sum=(n+1)/(a+1);
58     if(sum<k)
59     {
60         printf("-1
");
61         return 0;
62     }
63     for(int i=1; i<=m; i++)
64     {
65         scanf("%d",&x);
66         if(s.count(x))continue;
67         // for(it=s.begin();it!=s.end();it++)printf("%d
",*it);
68         if(test(x))
69         {
70             printf("%d
",i);
71             return 0;
72         }//printf("%d
",sum);
73         s.insert(x);
74     }
75     printf("-1
");
76 
77     return 0;
78 }