practice

happy birthday ! cook this round

Why did it WA?my submission

During he contest, I thought that was the intended solution. It works because a plant only be harvest(count/delete) for once.

• I used the idea to "simulate how we simply add two or more numbers."
• We will find the answer from last position to first position. First, store the contributions of all the digits.
• For example:- In string 379 , 3 will come to the last position 1 time (Only 3), 7 will come to the last position 2 times(37 and 7), and 9 will come to the last position in some substring 3 times(379,79 and 9). Or we can say s[i] contribution to last position will be i+1 (0-based indexing).
• Now, We will build the answer from last position from last position to first position. For this, we need to store "carry" term. After we process position i, we will delete the contribution of s[i] digit. At last, we will add if any carry left.
• Submission Link — https://atcoder.jp/contests/abc379/submissions/59605521

You misread the example. It is building index 3 and 5 (not height) that can be seen. Building index 3's height is 4 and building index 5's height is 5.

Try this test case;

1 1
1 
2