|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||1024 MB||61||18||18||36.735%|
Mirek is a conservator. His job is to maintain monuments, keeping them in good condition. Mirek’s today task is to repair the defense wall of an old fortress. The wall is about to fall to pieces, so he must hurry. He searched through the Internet and found a robot designed to repair such walls extremely fast. After purchasing the robot, he tried to make the optimal repairment plan, but this was way too difficult for him.
The wall can be considered as a straight line. Mirek wrote down all points on the wall, which require repairing. For each point he knows, what would be the cost Ci of repairing it, and a coefficient Di – how would the cost increase if it wasn’t repaired immediately. If the i-th point will be repaired after time t, then the cost of repairing it would be equal to:
Ci + t · Di
Given the coordinates of all points on the wall and the initial position of the robot, and knowing that transportation of the robot from point x1 to point x2 would take |x1 − x2| time, calculate the minimum cost of repairing all spoiled points. You can assume that repairing a single point takes no time.
On the first line of input there are two integers N and P (1 ≤ N ≤ 2 000, 0 ≤ P ≤ 109) – the number of points on the wall, which should be repaired, and the initial position of the robot. Then, N lines follow, i-th of these lines describes i-th point on the wall and contains three integers Xi , Ci and Di (0 ≤ Xi ≤ 109 , 0 ≤ Ci , Di ≤ 106 , Xi ≠ P) – the position of the point and cost coefficients. There are no two points with equal positions.
Output a single line with integer C, where C is the minimal cost of repairing all points on the wall.
3 7 10 32 1 3 5 1 14 0 2
The optimal plan of repairing points is:
Thus, the total cost of repairing the wall is 5 + 18 · 1 + 32 + 3 · 1 + 0 + 7 · 2 = 72.