codeforces-scrape

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

962D.md (1924B)


      1 Source: https://codeforces.com/problemset/problem/962/D
      2 
      3 D. Merge Equals
      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 You are given an array of positive integers. While there are at least two equal elements, we will perform the following operation. We choose the smallest value $x$ that occurs in the array $2$ or more times. Take the first two occurrences of $x$ in this array (the two leftmost occurrences). Remove the left of these two occurrences, and the right one is replaced by the sum of this two values (that is, $2 \cdot x$).
     22 
     23 Determine how the array will look after described operations are performed.
     24 
     25 For example, consider the given array looks like $[3, 4, 1, 2, 2, 1, 1]$. It will be changed in the following way: $[3, 4, 1, 2, 2, 1, 1]~\rightarrow~[3, 4, 2, 2, 2, 1]~\rightarrow~[3, 4, 4, 2, 1]~\rightarrow~[3, 8, 2, 1]$.
     26 
     27 If the given array is look like $[1, 1, 3, 1, 1]$ it will be changed in the following way: $[1, 1, 3, 1, 1]~\rightarrow~[2, 3, 1, 1]~\rightarrow~[2, 3, 2]~\rightarrow~[3, 4]$.
     28 
     29 Input
     30 
     31 The first line contains a single integer $n$ ($2 \le n \le 150\,000$) — the number of elements in the array.
     32 
     33 The second line contains a sequence from $n$ elements $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^{9}$) — the elements of the array.
     34 
     35 Output
     36 
     37 In the first line print an integer $k$ — the number of elements in the array after all the performed operations. In the second line print $k$ integers — the elements of the array after all the performed operations.
     38 
     39 Examples
     40 
     41 Input
     42 
     43 ```
     44 7  
     45 3 4 1 2 2 1 1
     46 ```
     47 
     48 Output
     49 
     50 ```
     51 4  
     52 3 8 2 1
     53 ```
     54 
     55 Input
     56 
     57 ```
     58 5  
     59 1 1 3 1 1
     60 ```
     61 
     62 Output
     63 
     64 ```
     65 2  
     66 3 4
     67 ```
     68 
     69 Input
     70 
     71 ```
     72 5  
     73 10 40 20 50 30
     74 ```
     75 
     76 Output
     77 
     78 ```
     79 5  
     80 10 40 20 50 30
     81 ```
     82 
     83 Note
     84 
     85 The first two examples were considered in the statement.
     86 
     87 In the third example all integers in the given array are distinct, so it will not change.