Count Interval

AtCoder

IDabc233_d

Time2000ms

Memory256MB

Difficulty—

Given is a sequence of length $N$: $A=(A_1,A_2,\ldots,A_N)$, and an integer $K$. How many of the contiguous subsequences of $A$ have the sum of $K$? In other words, how many pairs of integers $(l,r)$ satisfy all of the conditions below? * $1\leq l\leq r\leq N$ * $\displaystyle\sum_{i=l}^{r}A_i = K$ ## Constraints * $1\leq N \leq 2\times 10^5$ * $|A_i| \leq 10^9$ * $|K| \leq 10^{15}$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $K$ $A_1$ $A_2$ $\ldots$ $A_N$ [samples]

Samples

Input #1

6 5
8 -3 5 7 0 -4

Output #1

3

$(l,r)=(1,2),(3,3),(2,6)$ are the three pairs that satisfy the conditions.

Input #2

2 -1000000000000000
1000000000 -1000000000

Output #2

0

There may be no pair that satisfies the conditions.

API Response (JSON)

{
  "problem": {
    "name": "Count Interval",
    "description": {
      "content": "Given is a sequence of length $N$: $A=(A_1,A_2,\\ldots,A_N)$, and an integer $K$. How many of the contiguous subsequences of $A$ have the sum of $K$?   In other words, how many pairs of integers $(l,r)",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc233_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given is a sequence of length $N$: $A=(A_1,A_2,\\ldots,A_N)$, and an integer $K$.\nHow many of the contiguous subsequences of $A$ have the sum of $K$?  \nIn other words, how many pairs of integers $(l,r)...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments