Querying Multiset

AtCoder

IDabc212_d

Time2000ms

Memory256MB

Difficulty—

Takahashi has many balls, on which nothing is written, and one bag. Initially, the bag is empty. Takahashi will do $Q$ operations, each of which is of one of the following three types. * Type $1$: Write an integer $X_i$ on a blank ball and put it in the bag. * Type $2$: For each ball in the bag, replace the integer written on it with that integer plus $X_i$. * Type $3$: Pick up the ball with the smallest integer in the bag (if there are multiple such balls, pick up one of them). Record the integer written on this ball and throw it away. For each $1\leq i\leq Q$, you are given the type $P_i$ of the $i$\-th operation and the value of $X_i$ if the operation is of Type $1$ or $2$. Print the integers recorded in the operations of Type $3$ in order. ## Constraints * $1 \leq Q \leq 2\times 10^5$ * $1 \leq P_i \leq 3$ * $1 \leq X_i \leq 10^9$ * All values in input are integers. * There is one or more $i$ such that $P_i=3$. * If $P_i=3$, the bag contains at least one ball just before the $i$\-th operation. ## Input Input is given from Standard Input in the following format: $Q$ $query_1$ $query_2$ $:$ $query_Q$ Each $query_i$ in the $2$\-nd through $(Q+1)$\-th lines is in the following format: $1$ $X_i$ $2$ $X_i$ $3$ The first number in each line is $1\leq P_i\leq 3$, representing the type of the operation. If $P_i=1$ or $P_i=2$, it is followed by a space, and then by $X_i$. [samples]

Samples

Input #1

Output #1

3
7

Takahashi will do the following operations.

*   Write $3$ on a ball and put it in the bag.
*   Write $5$ on a ball and put it in the bag.
*   The bag now contains a ball with $3$ and another with $5$. Pick up the ball with the smaller of them, or $3$. Record $3$ and throw it away.
*   The bag now contains just a ball with $5$. Replace this integer with $5+2=7$.
*   The bag now contains just a ball with $7$. Pick up this ball, record $7$, and throw it away.

Therefore, we should print $3$ and $7$, in the order they are recorded.

Input #2

6
1 1000000000
2 1000000000
2 1000000000
2 1000000000
2 1000000000
3

Output #2

5000000000

Note that the outputs may not fit into a $32$\-bit integer.

API Response (JSON)

{
  "problem": {
    "name": "Querying Multiset",
    "description": {
      "content": "Takahashi has many balls, on which nothing is written, and one bag. Initially, the bag is empty. Takahashi will do $Q$ operations, each of which is of one of the following three types. *   Type $1$: ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc212_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Takahashi has many balls, on which nothing is written, and one bag. Initially, the bag is empty. Takahashi will do $Q$ operations, each of which is of one of the following three types.\n\n*   Type $1$: ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments