Range Count Query

AtCoder

IDabc248_d

Time2000ms

Memory256MB

Difficulty—

You are given a sequence of length $N$: $A=(A_1,\ldots,A_N)$. Answer $Q$ queries given in the following format. * You are given integers $L$, $R$, and $X$. Find the number of elements among $A_L, \ldots, A_R$ whose values are equal to $X$. ## Constraints * $1 \leq N \leq 2\times 10^5$ * $1 \leq A_i \leq N$ * $1 \leq Q \leq 2\times 10^5$ * $1\le L \leq R \leq N, 1 \leq X \leq N$, for each query. * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $A_1$ $A_2$ $\ldots$ $A_N$ $Q$ $\mathrm{Query}_1$ $\mathrm{Query}_2$ $\vdots$ $\mathrm{Query}_Q$ Here, $\mathrm{Query}_i$ represents the $i$\-th query. Each query is in the following format: $L$ $R$ $X$ [samples]

Samples

Input #1

Output #1

2
0
0
1

In the first query, two of $(A_1,A_2,A_3,A_4,A_5) =(3,1,4,1,5)$ have values equal to $1$.
In the second query, zero of $(A_2,A_3,A_4) =(1,4,1)$ have values equal to $3$.

API Response (JSON)

{
  "problem": {
    "name": "Range Count Query",
    "description": {
      "content": "You are given a sequence of length $N$: $A=(A_1,\\ldots,A_N)$. Answer $Q$ queries given in the following format. *   You are given integers $L$, $R$, and $X$. Find the number of elements among $A_L, \\",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc248_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a sequence of length $N$: $A=(A_1,\\ldots,A_N)$.\nAnswer $Q$ queries given in the following format.\n\n*   You are given integers $L$, $R$, and $X$. Find the number of elements among $A_L, \\...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments