codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1198B.md (2101B)


      1 Source: https://codeforces.com/problemset/problem/1198/B
      2 
      3 B. Welfare State
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 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.
     24 
     25 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.
     26 
     27 Input
     28 
     29 The first line contains a single integer $n$ ($1 \le n \le 2 \cdot 10^{5}$) — the numer of citizens.
     30 
     31 The next line contains $n$ integers $a_1$, $a_2$, ..., $a_n$ ($0 \le a_{i} \le 10^{9}$) — the initial balances of citizens.
     32 
     33 The next line contains a single integer $q$ ($1 \le q \le 2 \cdot 10^{5}$) — the number of events.
     34 
     35 Each of the next $q$ lines contains a single event. The events are given in chronological order.
     36 
     37 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$.
     38 
     39 Output
     40 
     41 Print $n$ integers — the balances of all citizens after all events.
     42 
     43 Examples
     44 
     45 Input
     46 
     47 ```
     48 4
     49 1 2 3 4
     50 3
     51 2 3
     52 1 2 2
     53 2 1
     54 ```
     55 
     56 Output
     57 
     58 ```
     59 3 2 3 4
     60 ```
     61 
     62 Input
     63 
     64 ```
     65 5
     66 3 50 2 1 10
     67 3
     68 1 2 0
     69 2 8
     70 1 3 20
     71 ```
     72 
     73 Output
     74 
     75 ```
     76 8 8 20 8 10
     77 ```
     78 
     79 Note
     80 
     81 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
     82 
     83 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