CF1198B.Welfare State
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
There is a country with n citizens. The i -th of them initially has ai 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≤n≤2⋅105 ) — the numer of citizens.
The next line contains n integers a1 , a2 , ..., an ( 0≤ai≤109 ) — the initial balances of citizens.
The next line contains a single integer q ( 1≤q≤2⋅105 ) — 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≤p≤n , 0≤x≤109 ), or 2 x ( 0≤x≤109 ). 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
说明/提示
In the first example the balances change as follows: 1 2 3 4 → 3 3 3 4 → 3 2 3 4 → 3 2 3 4
In the second example the balances change as follows: 3 50 2 1 10 → 3 0 2 1 10 → 8 8 8 8 10 → 8 8 20 8 10