A child is playing a cloud hopping game. In this game, there are sequentially numbered clouds that can be thunderheads or cumulus clouds. The character must jump from cloud to cloud until it reaches the start again.
There is an array of clouds, and an energy level . The character starts from and uses unit of energy to make a jump of size to cloud . If it lands on a thundercloud, , its energy () decreases by additional units. The game ends when the character lands back on cloud .
Given the values of , , and the configuration of the clouds as an array , determine the final value of after the game ends.
The indices of the path are . The energy level reduces by for each jump to . The character landed on one thunderhead at an additional cost of energy units. The final energy level is .
Note: Recall that refers to the modulo operation. In this case, it serves to make the route circular. If the character is at and jumps , it will arrive at .
Complete the jumpingOnClouds function in the editor below.
jumpingOnClouds has the following parameter(s):
int c[n]: the cloud types along the path
int k: the length of one jump
int: the energy level remaining.
The first line contains two space-separated integers, and , the number of clouds and the jump distance.
The second line contains space-separated integers where . Each cloud is described as follows:
If , then cloud is a cumulus cloud.
If , then cloud is a thunderhead.
8 2 n = 8, k = 2
0 0 1 0 0 1 1 0 c = [0, 0, 1, 0, 0, 1, 1, 0]
In the diagram below, red clouds are thunderheads and purple clouds are cumulus clouds:
Observe that our thunderheads are the clouds numbered , , and . The character makes the following sequence of moves: