BoatAlignment coding task - Learn to Code

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

int solution(int R[], int N, int X, int M);

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

int solution(vector<int> &R, int X, int M);

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

int solution(vector<int> &R, int X, int M);

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

class Solution { public int solution(int[] R, int X, int M); }

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

int solution(List<int> R, int X, int M);

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

func Solution(R []int, X int, M int) int

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

class Solution { public int solution(int[] R, int X, int M); }

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

class Solution { public int solution(int[] R, int X, int M); }

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

function solution(R, X, M);

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

fun solution(R: IntArray, X: Int, M: Int): Int

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

function solution(R, X, M)

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

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.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

int solution(NSMutableArray *R, int X, int M);

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

function solution(R: array of longint; N: longint; X: longint; M: longint): longint;

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

function solution($R, $X, $M);

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

sub solution { my ($R, $X, $M) = @_; my @R = @$R; ... }

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

def solution(R, X, M)

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

def solution(r, x, m)

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

object Solution { def solution(r: Array[Int], x: Int, m: Int): Int }

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

public func solution(_ R : inout [Int], _ X : Int, _ M : Int) -> Int

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

function solution(R: number[], X: number, M: number): number;

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

You are helping the port management to organize boats moored in a port. There is a straight wharf with N mooring bollards and N boats. The wharf (and the dock in front of it) is of length M. Each boat has the same width: 2*X. The bollards are located at the very edge of the wharf. It is possible for more than one bollard to be at the same position.

You have to moor each boat to a separate bollard so that the following rules are satisfied:

each boat is fixed with a single mooring rope to the bank of the wharf,

the mooring rope connects the middle of the boat's bow with a bollard,

the middle of the boat's bow can be set only on integer positions,

the sides of the boats can touch each other,

boats cannot overlap,

boats cannot be placed outside the dock or extend it,

two boats cannot be tied to the same bollard.

All the boats must have mooring ropes of the same length. The goal is to minimize this length.

More formally, let the max distance be the largest distance between the middle of any boat's bow and the bollard to which the boat is moored. The goal is to align the boats so that the max distance is as small as possible.

You are given a non-empty array R of N integers, and two positive integers X and M. Array R contains the positions of the bollards along the wharf. The wharf's ends are at positions 0 and M.

For example, the following array R, and integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

describe:

three bollards at positions 1, 3 and 14,

three boats of width 4,

a wharf of length 16.

You can set:

the center of the first boat at position 2,

the center of the second boat at position 6,

the center of the third boat at position 14.

Between the first boat and the first bollard the distance is 1; between the second boat and the second bollard it is 3; and between the third boat and the third bollard it is 0; so the max distance is 3.

Write a function:

Private Function solution(R As Integer(), X As Integer, M As Integer) As Integer

that, given an array R consisting of N integers, given two integers X and M, returns the minimal max distance you can achieve.

If it is not possible to tie all the boats, the function should return −1.

For example, given the following array R, integers X and M:

R[0] = 1 X = 2 R[1] = 3 M = 16 R[2] = 14

the function should return 3, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

X and M are integers within the range [1..1,000,000,000];

each element of array R is an integer within the range [0..M];

array R is sorted in non-decreasing order.

BoatAlignment

Developer Training

Sign up for our newsletter:

Social: