Codeforces Round 576 (Div. 1)
B
Welfare State
Codeforces
1600
原题
← AC →
翻译中…

There is a country with $n$ citizens. The $i$-th of them initially has $a_{i}$ money. The government strictly controls the wealth of its citizens. Whenever a citizen makes a purchase or earns some money, they must send a receipt to the social services mentioning the amount of money they currently have.

翻译中…

Sometimes the government makes payouts to the poor: all citizens who have strictly less money than $x$ are paid accordingly so that after the payout they have exactly $x$ money. In this case the citizens don't send a receipt.

翻译中…

You know the initial wealth of every citizen and the log of all events: receipts and payouts. Restore the amount of money each citizen has after all events.

翻译中…

Input

翻译中…

The first line contains a single integer $n$ ($1 \le n \le 2 \cdot 10^{5}$) — the numer of citizens.

翻译中…

The next line contains $n$ integers $a_1$, $a_2$, ..., $a_n$ ($0 \le a_{i} \le 10^{9}$) — the initial balances of citizens.

翻译中…

The next line contains a single integer $q$ ($1 \le q \le 2 \cdot 10^{5}$) — the number of events.

翻译中…

Each of the next $q$ lines contains a single event. The events are given in chronological order.

翻译中…

Each event is described as either 1 p x ($1 \le p \le n$, $0 \le x \le 10^{9}$), or 2 x ($0 \le x \le 10^{9}$). In the first case we have a receipt that the balance of the $p$-th person becomes equal to $x$. In the second case we have a payoff with parameter $x$.

翻译中…

Output

翻译中…

Print $n$ integers — the balances of all citizens after all events.

翻译中…

Note

翻译中…

In the first example the balances change as follows: 1 2 3 4 $\rightarrow$ 3 3 3 4 $\rightarrow$ 3 2 3 4 $\rightarrow$ 3 2 3 4

翻译中…

In the second example the balances change as follows: 3 50 2 1 10 $\rightarrow$ 3 0 2 1 10 $\rightarrow$ 8 8 8 8 10 $\rightarrow$ 8 8 20 8 10

翻译中…

样例

Input #1
4
1 2 3 4
3
2 3
1 2 2
2 1
Output #1
3 2 3 4
InputCopy OutputCopy
Input #2
5
3 50 2 1 10
3
1 2 0
2 8
1 3 20
Output #2
8 8 20 8 10
InputCopy OutputCopy
题目信息
题号
1198B
时间限制
2 s
内存限制
256 MB
标签
二分
暴力
数据结构
排序

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。