Gap Existence

AtCoder

IDabc296_c

Time2000ms

Memory256MB

Difficulty—

You are given a sequence of $N$ numbers: $A=(A_1,\ldots,A_N)$. Determine whether there is a pair $(i,j)$ with $1\leq i,j \leq N$ such that $A_i-A_j=X$. ## Constraints * $2 \leq N \leq 2\times 10^5$ * $-10^9 \leq A_i \leq 10^9$ * $-10^9 \leq X \leq 10^9$ * All values in the input are integers. ## Input The input is given from Standard Input in the following format: $N$ $X$ $A_1$ $\ldots$ $A_N$ [samples]

Samples

Input #1

6 5
3 1 4 1 5 9

Output #1

Yes

We have $A_6-A_3=9-4=5$.

Input #2

6 -4
-2 -7 -1 -8 -2 -8

Output #2

No

There is no pair $(i,j)$ such that $A_i-A_j=-4$.

Input #3

2 0
141421356 17320508

Output #3

Yes

We have $A_1-A_1=0$.

API Response (JSON)

{
  "problem": {
    "name": "Gap Existence",
    "description": {
      "content": "You are given a sequence of $N$ numbers: $A=(A_1,\\ldots,A_N)$. Determine whether there is a pair $(i,j)$ with $1\\leq i,j \\leq N$ such that $A_i-A_j=X$.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc296_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a sequence of $N$ numbers: $A=(A_1,\\ldots,A_N)$.\nDetermine whether there is a pair $(i,j)$ with $1\\leq i,j \\leq N$ such that $A_i-A_j=X$.\n\n## Constraints\n\n*   $2 \\leq N \\leq 2\\times 10^5...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments