codeforces-scrape

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

1108D.md (1836B)


      1 Source: https://codeforces.com/problemset/problem/1108/D
      2 
      3 D. Diverse Garland
      4 
      5 time limit per test
      6 
      7 1 second
      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 have a garland consisting of $n$ lamps. Each lamp is colored red, green or blue. The color of the $i$-th lamp is $s_i$ ('R', 'G' and 'B' — colors of lamps in the garland).
     22 
     23 You have to recolor some lamps in this garland (recoloring a lamp means changing its initial color to another) in such a way that the obtained garland is diverse.
     24 
     25 A garland is called diverse if any two adjacent (consecutive) lamps (i. e. such lamps that the distance between their positions is $1$) have distinct colors.
     26 
     27 In other words, if the obtained garland is $t$ then for each $i$ from $1$ to $n-1$ the condition $t_i \ne t_{i + 1}$ should be satisfied.
     28 
     29 Among all ways to recolor the initial garland to make it diverse you have to choose one with the minimum number of recolored lamps. If there are multiple optimal solutions, print any of them.
     30 
     31 Input
     32 
     33 The first line of the input contains one integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the number of lamps.
     34 
     35 The second line of the input contains the string $s$ consisting of $n$ characters 'R', 'G' and 'B' — colors of lamps in the garland.
     36 
     37 Output
     38 
     39 In the first line of the output print one integer $r$ — the minimum number of recolors needed to obtain a diverse garland from the given one.
     40 
     41 In the second line of the output print one string $t$ of length $n$ — a diverse garland obtained from the initial one with minimum number of recolors. If there are multiple optimal solutions, print any of them.
     42 
     43 Examples
     44 
     45 Input
     46 
     47 ```
     48 9
     49 RBGRRBRGG
     50 ```
     51 
     52 Output
     53 
     54 ```
     55 2
     56 RBGRGBRGR
     57 ```
     58 
     59 Input
     60 
     61 ```
     62 8
     63 BBBGBRRR
     64 ```
     65 
     66 Output
     67 
     68 ```
     69 2
     70 BRBGBRGR
     71 ```
     72 
     73 Input
     74 
     75 ```
     76 13
     77 BBRRRRGGGGGRR
     78 ```
     79 
     80 Output
     81 
     82 ```
     83 6
     84 BGRBRBGBGBGRG
     85 ```