Replacing

AtCoder

IDabc171_d

Time2000ms

Memory256MB

Difficulty—

You have a sequence $A$ composed of $N$ positive integers: $A_{1}, A_{2}, \cdots, A_{N}$. You will now successively do the following $Q$ operations: * In the $i$\-th operation, you replace every element whose value is $B_{i}$ with $C_{i}$. For each $i$ $(1 \leq i \leq Q)$, find $S_{i}$: the sum of all elements in $A$ just after the $i$\-th operation. ## Constraints * All values in input are integers. * $1 \leq N, Q, A_{i}, B_{i}, C_{i} \leq 10^{5}$ * $B_{i} \neq C_{i}$ ## Input Input is given from Standard Input in the following format: $N$ $A_{1}$ $A_{2}$ $\cdots$ $A_{N}$ $Q$ $B_{1}$ $C_{1}$ $B_{2}$ $C_{2}$ $\vdots$ $B_{Q}$ $C_{Q}$ [samples]

Samples

Input #1

Output #1

11
12
16

Initially, the sequence $A$ is $1,2,3,4$.
After each operation, it becomes the following:

*   $2, 2, 3, 4$
*   $2, 2, 4, 4$
*   $4, 4, 4, 4$

Input #2

Output #2

8
4
4

Note that the sequence $A$ may not contain an element whose value is $B_{i}$.

Input #3

Output #3

102
200
2000

API Response (JSON)

{
  "problem": {
    "name": "Replacing",
    "description": {
      "content": "You have a sequence $A$ composed of $N$ positive integers: $A_{1}, A_{2}, \\cdots, A_{N}$. You will now successively do the following $Q$ operations: *   In the $i$\\-th operation, you replace every el",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc171_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You have a sequence $A$ composed of $N$ positive integers: $A_{1}, A_{2}, \\cdots, A_{N}$.\nYou will now successively do the following $Q$ operations:\n\n*   In the $i$\\-th operation, you replace every el...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments