HCI '16 - Cheapest Operation Ever

View as PDF

Points: 20 (partial)
Time limit: 0.6s
Memory limit: 128M

Authors:
Problem type

Roy is helping the police department of his city in crime fighting. Today, they informed him about a new planned operation. The city has only one road and criminals live there! To catch these criminals, the police department has to recruit some police officers and give each of them as wages. A police officer can start his operation from any point , drive his car to point in a straight line, and catch all the criminals who live on this way.

The cost of the fuel used

Thus, find the minimum amount of money spent to catch all the criminals.

Constraints

Sample test cases.

Input Specification

st line: Number of criminals () and value of

nd line: Position of where the criminals live

Output Specification

st line: Minimum amount of money spent.

5 10
1 4 5 6 9

34

Explanation

One police deployed at position

One police deployed at position , travel until position

One police deployed at position

Total

Original Problem Author: Bidhan; Problem Resource: HackerRank

• commented on Nov. 26, 2020, 4:28 p.m. edited

Does anyone know how I can optimize my code to get ?

• commented on Nov. 26, 2020, 5:56 p.m.
• commented on Nov. 27, 2020, 3:51 p.m.

took me a while to figure out the query/insert operations, but CHT is a really cool optimization technique!

• commented on Feb. 22, 2020, 8:11 p.m.

Copy of a problem from the University of Chicago Invitational Programming Contest 2012: https://www.e-olymp.com/en/problems/3972

• commented on Aug. 20, 2017, 5:00 p.m.
1. Are criminals given in order of position?
2. Are positions of all criminals distinct?
• commented on Aug. 20, 2017, 5:03 p.m.

Yes and yes.