codeforces-scrape

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

402B.md (1998B)


      1 Source: https://codeforces.com/problemset/problem/402/B
      2 
      3 B. Trees in a Row
      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 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 The Queen of England has *n* trees growing in a row in her garden. At that, the *i*-th (1 ≤ *i* ≤ *n*) tree from the left has height *a**i* meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all *i* (1 ≤ *i* < *n*), *a**i* + 1 - *a**i* = *k*, where *k* is the number the Queen chose.
     22 
     23 Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?
     24 
     25 Input
     26 
     27 The first line contains two space-separated integers: *n*, *k* (1 ≤ *n*, *k* ≤ 1000). The second line contains *n* space-separated integers *a*1, *a*2, ..., *a**n* (1 ≤ *a**i* ≤ 1000) — the heights of the trees in the row.
     28 
     29 Output
     30 
     31 In the first line print a single integer *p* — the minimum number of minutes the gardener needs. In the next *p* lines print the description of his actions.
     32 
     33 If the gardener needs to increase the height of the *j*-th (1 ≤ *j* ≤ *n*) tree from the left by *x* (*x* ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the *j*-th (1 ≤ *j* ≤ *n*) tree from the left by *x* (*x* ≥ 1) meters, print on the corresponding line "- j x".
     34 
     35 If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 4 1  
     43 1 2 1 5
     44 ```
     45 
     46 Output
     47 
     48 ```
     49 2  
     50 + 3 2  
     51 - 4 1
     52 ```
     53 
     54 Input
     55 
     56 ```
     57 4 1  
     58 1 2 3 4
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 0
     65 ```