Simulate a cannon shooting and heaps of falling cannonballs
Sign up for our newsletter:
Information about upcoming challenges, solutions and lessons directly in your inbox.
Social:
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Assume that the following declarations are given:
struct Results { int * A1; int M; // Length of the array };
Write a function:
struct Results solution(int A[], int M, int B[], int N);
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
vector<int> solution(vector<int> &A, vector<int> &B);
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
vector<int> solution(vector<int> &A, vector<int> &B);
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
class Solution { public int[] solution(int[] A, int[] B); }
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
List<int> solution(List<int> A, List<int> B);
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
func Solution(A []int, B []int) []int
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
class Solution { public int[] solution(int[] A, int[] B); }
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
class Solution { public int[] solution(int[] A, int[] B); }
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
function solution(A, B);
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
fun solution(A: IntArray, B: IntArray): IntArray
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
function solution(A, B)
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
Note: All arrays in this task are zero-indexed, unlike the common Lua convention. You can use #A to get the length of the array A.
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
NSMutableArray * solution(NSMutableArray *A, NSMutableArray *B);
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Assume that the following declarations are given:
Results = record A1 : array of longint; M : longint; {Length of the array} end;
Write a function:
function solution(A: array of longint; M: longint; B: array of longint; N: longint): Results;
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
function solution($A, $B);
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
sub solution { my ($A, $B) = @_; my @A = @$A; my @B = @$B; ... }
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
def solution(A, B)
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
def solution(a, b)
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
object Solution { def solution(a: Array[Int], b: Array[Int]): Array[Int] }
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
public func solution(_ A : inout [Int], _ B : inout [Int]) -> [Int]
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
function solution(A: number[], B: number[]): number[];
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
A new kind of cannon is being tested. The cannon shoots cannonballs in a fixed direction. Each cannonball flies horizontally until it hits the ground, and then it rests there. Cannonballs are shot from different heights, so they hit the ground at different points.
You are given two arrays, A and B, containing M and N integers respectively. Array A describes the landscape in the direction along which the cannon is shooting. Elements of array A represent the height of the ground, going from the cannon outwards. Array B contains levels from which consecutive cannonballs are shot.
Assume that a cannonball is shot at level H.
- Let I be the smallest index, such that 0 < I < M and A[I] ≥ H. The cannonball falls at position I − 1 and increases the ground level A[I−1] by 1.
- If there is no such I, and H > A[I] for all 0 ≤ I < M, then the cannonball flies beyond the horizon and has no effect on the result.
- If H ≤ A[0], then the cannonball ricochets away and has no effect on the result either.
Write a function:
Private Function solution(A As Integer(), B As Integer()) As Integer()
that, given arrays A and B, simulates the flight of the cannonballs and returns the final contents of array A (denoted by A1) representing the final shape of the ground along the line of fire.
For example, given the following arrays A and B, of size M = 9 and N = 11 respectively:
A[0] = 1 A[1] = 2 A[2] = 0 A[3] = 4 A[4] = 3 A[5] = 2 A[6] = 1 A[7] = 5 A[8] = 7 B[0] = 2 B[1] = 8 B[2] = 0 B[3] = 7 B[4] = 6 B[5] = 5 B[6] = 3 B[7] = 4 B[8] = 5 B[9] = 6 B[10]= 5the function should return the following array A1 of M = 9 integers:
A1[0] = 2 A1[1] = 2 A1[2] = 2 A1[3] = 4 A1[4] = 3 A1[5] = 3 A1[6] = 5 A1[7] = 6 A1[8] = 7Write an efficient algorithm for the following assumptions:
- M and N are integers within the range [0..30,000];
- each element of arrays A and B is an integer within the range [0..1,000,000].
Information about upcoming challenges, solutions and lessons directly in your inbox.