Iroha and Haiku (New ABC Edition)

AtCoder

IDabc265_d

Time2000ms

Memory256MB

Difficulty—

There is a sequence $A=(A_0,\ldots,A_{N-1})$ of length $N$. Determine if there exists a tuple of integers $(x,y,z,w)$ that satisfies all of the following conditions: * $0 \leq x < y < z < w \leq N$ * $A_x + A_{x+1} + \ldots + A_{y-1} = P$ * $A_y + A_{y+1} + \ldots + A_{z-1} = Q$ * $A_z + A_{z+1} + \ldots + A_{w-1} = R$ ## Constraints * $3 \leq N \leq 2\times 10^5$ * $1 \leq A_i \leq 10^9$ * $1 \leq P,Q,R \leq 10^{15}$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $P$ $Q$ $R$ $A_0$ $A_1$ $\ldots$ $A_{N-1}$ [samples]

Samples

Input #1

10 5 7 5
1 3 2 2 2 3 1 4 3 2

Output #1

Yes

$(x,y,z,w)=(1,3,6,8)$ satisfies the conditions.

Input #2

9 100 101 100
31 41 59 26 53 58 97 93 23

Output #2

No

Input #3

7 1 1 1
1 1 1 1 1 1 1

Output #3

Yes

API Response (JSON)

{
  "problem": {
    "name": "Iroha and Haiku (New ABC Edition)",
    "description": {
      "content": "There is a sequence $A=(A_0,\\ldots,A_{N-1})$ of length $N$.   Determine if there exists a tuple of integers $(x,y,z,w)$ that satisfies all of the following conditions: *   $0 \\leq x < y < z < w \\leq ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc265_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There is a sequence $A=(A_0,\\ldots,A_{N-1})$ of length $N$.  \nDetermine if there exists a tuple of integers $(x,y,z,w)$ that satisfies all of the following conditions:\n\n*   $0 \\leq x < y < z < w \\leq ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments