Please explain this test case for CF 563 Div3 D

Revision en3, by gatecse2018, 2020-06-30 06:24:27

Problem link: https://codeforces.me/contest/1374/problem/D Thie first test case is:
~~~~~ 4 3 1 2 1 3 ~~~~~ In the first move, increment x by 1.

So now, the array is: 1 2 1 3 and x = 1
Next move, increment 2nd element by x and increment x by 1, so: 1 3 1 3 and x = 2
Next move, increment 3rd element by x and increment x by 1, so: 1 3 3 3 and x = 3
Next move, increment x by 1, so: 1 3 3 3 and x = 4
Next move, increment x by 1, so: 1 3 3 3 and x = 5
Next move, increment 1st element by x and increment x by 1, so: 6 3 3 3 and x = 6

Total moves = 6. But this array configuration is different from the one given in the testcase explanation given under the problem. Are multiple correct configs possible? Or am I missing something?

Tags 563, div3

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English gatecse2018 2020-06-30 06:24:27 61
en2 English gatecse2018 2020-06-30 06:18:21 36
en1 English gatecse2018 2020-06-30 06:17:45 737 Initial revision (published)