codeforces 479D Long Jumps（枚举）

题目链接

 Long Jumps

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!

However, there is no reason for disappointment, as Valery has found another ruler, its length is l centimeters. The ruler already has n marks, with which he can make measurements. We assume that the marks are numbered from 1 to n in the order they appear from the beginning of the ruler to its end. The first point coincides with the beginning of the ruler and represents the origin. The last mark coincides with the end of the ruler, at distance l from the origin. This ruler can be repesented by an increasing sequence a₁, a₂, ..., a_n, where a_i denotes the distance of the i-th mark from the origin (a₁ = 0, a_n = l).

Valery believes that with a ruler he can measure the distance of d centimeters, if there is a pair of integers i and j (1 ≤ i ≤ j ≤ n), such that the distance between the i-th and the j-th mark is exactly equal to d (in other words, a_j - a_i = d).

Under the rules, the girls should be able to jump at least x centimeters, and the boys should be able to jump at least y (x < y) centimeters. To test the children's abilities, Valery needs a ruler to measure each of the distances x and y.

Your task is to determine what is the minimum number of additional marks you need to add on the ruler so that they can be used to measure the distances x and y. Valery can add the marks at any integer non-negative distance from the origin not exceeding the length of the ruler.

Input

The first line contains four positive space-separated integers n, l, x, y (2 ≤ n ≤ 10⁵, 2 ≤ l ≤ 10⁹, 1 ≤ x < y ≤ l) — the number of marks, the length of the ruler and the jump norms for girls and boys, correspondingly.

The second line contains a sequence of n integers a₁, a₂, ..., a_n (0 = a₁ < a₂ < ... < a_n = l), where a_i shows the distance from the i-th mark to the origin.

Output

In the first line print a single non-negative integer v — the minimum number of marks that you need to add on the ruler.

In the second line print v space-separated integers p₁, p₂, ..., p_v (0 ≤ p_i ≤ l). Number p_i means that the i-th mark should be at the distance of p_i centimeters from the origin. Print the marks in any order. If there are multiple solutions, print any of them.

Sample test(s)

Input

3 250 185 230
0 185 250

Output

1
230

Input

4 250 185 230
0 20 185 250

Output

0

Input

2 300 185 230
0 300

Output

2
185 230

题意：长度为l的尺子，尺子上有n个刻度，它们的位置是a1，a2.....an（0=a1<a2<.......an=l）。如果存在i，j，使得i<=j且aj-ai=d，那么长度d就可以测量。现在要测量长度x和y，问最少添加多少个刻度，并输出方案？

题解：先O（n）扫一遍，原有的刻度能否测出x和y。如果x和y都不能测出，我们需要判断能否只添加一个刻度能让x和y都能测出，枚举添加一个刻度的位置在原有的刻度的左边或右边即可。

代码如下：

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<string>
#include<stack>
#include<math.h>
#include<vector>
#include<set>
#include<map>
#define nn 110000
#define inff 0x3fffffff
#define eps 1e-8
#define mod 1000000007
typedef long long LL;
const LL inf64=LL(inff)*inff;
using namespace std;
int n,l,x,y;
map<int,int>ma;
int a[nn];
vector<int>ve;
int main()
{
    int i;
    while(scanf("%d%d%d%d",&n,&l,&x,&y)!=EOF)
    {
        int ix;
        bool g=false,b=false;
        ma.clear();
        for(i=1;i<=n;i++)
        {
            scanf("%d",&ix);
            a[i]=ix;
            ma[ix]=1;
            if(ma.count(ix-x))
            {
                g=true;
            }
            if(ma.count(ix-y))
                b=true;
        }
        ve.clear();
        if(!g&&!b)
        {
            for(i=1;i<=n;i++)
            {
                if(a[i]-x>=0)
                {
                    ix=a[i]-x;
                    if(ma.count(ix-y))
                    {
                        ve.push_back(ix);
                        break;
                    }
                    if(ma.count(ix+y))
                    {
                        ve.push_back(ix);
                        break;
                    }
                }
                if(a[i]+x<=l)
                {
                    ix=a[i]+x;
                    if(ma.count(ix-y))
                    {
                        ve.push_back(ix);
                        break;
                    }
                    if(ma.count(ix+y))
                    {
                        ve.push_back(ix);
                        break;
                    }
                }
            }
            if(i>n)
            {
                ve.push_back(x);
                ve.push_back(y);
            }
        }
        else if(!g)
            ve.push_back(x);
        else if(!b)
            ve.push_back(y);
        printf("%d\n",ve.size());
        for(i=0;i<(int)ve.size();i++)
            printf("%d%c",ve[i],i==(int)ve.size()-1?'\n':' ');
    }
    return 0;
}