题库练习 Welfare State
← 上一题 下一题 →

A12857 | Welfare State

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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.

输入格式

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$ .

输出格式

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

输入输出样例

输入 #1
4
1 2 3 4
3
2 3
1 2 2
2 1
输出 #1
3 2 3 4 
输入 #2
5
3 50 2 1 10
3
1 2 0
2 8
1 3 20
输出 #2
8 8 20 8 10 
C++ 编辑器
输入
输出