IOI '09 - Plovdiv, Bulgaria


The traveling salesman has decided that optimally scheduling his trips on land is an intractable computational problem, so he is moving his business to the linear world of the Danube River. He has a very fast boat that can get him from anywhere to anywhere along the river in no time, but unfortunately the boat has terrible fuel consumption. It costs the salesman U dollars for every meter traveled upstream (towards the source of the river) and D dollars for every meter traveled downstream (away from the source of the river).

There are N trade fairs that the salesman would like to visit along the river. Each trade fair is held for one day only. For each trade fair X, the traveling salesman knows its date TX, measured in the number of days since he purchased his boat. He also knows the fair's location LX, measured as the distance in meters from the source of the river downstream to the fair, as well as the number of dollars MX that the salesman is going to gain if he attends this trade fair. He has to start and end his journey at his waterfront home on the river, which is at location S, measured also in meters downstream from the source of the river.

Help the traveling salesman choose which trade fairs to attend (if any) and in what order, so that he may maximize his profit at the end of his travels. The traveling salesman's total profit is defined as the sum of the dollars he gained at the fairs he attended, minus the total sum of dollars he spent traveling up and down the river.

Keep in mind that if trade fair A is held earlier than trade fair B, the salesman can visit them only in this order (i.e., he cannot visit B and then visit A). However, if two fairs are held on the same date, the salesman can visit them both in any order. There is no limit to how many fairs the salesman can visit in a day, but naturally he can't visit the same fair twice and reap the gains twice. He can pass through fairs he has already visited without gaining anything.

Write a program that, given the date, location and profitability of all fairs, as well as the location of the traveling salesman's home and his costs of traveling, determines the maximum possible profit he can make by the end of his journey.


Your program must read from standard input the following data:

  • The first line contains the integers N (1 ≤ N ≤ 500000), U, D (1 ≤ DU ≤ 10), and S (1 ≤ S ≤ 500001), in this order, separated by single spaces.
  • The next N lines describe the N fairs in no particular order. The kth of these N lines describes the kth fair and contains three integers separated by single spaces: the day of the fair Tk (1 ≤ Tk ≤ 500000), its location Lk (1 ≤ Lk ≤ 500001), and its profitability for the salesman Mk (1 ≤ Mk ≤ 4000).

NOTE: All locations given in the input will be different. That is to say, no two fairs will happen at the same location and no fair will happen at the salesman's home.


Your program must write to standard output a single line containing a single integer: the maximum profit the salesman can possibly make by the end of his journey.

Sample Input

4 5 3 100
2 80 100
20 125 130
10 75 150
5 120 110

Sample Output



An optimal schedule would visit fairs 1 and 3 (the ones at locations 80 and 75). The sequence of events and their associated profits and costs would be as follows:

  • The salesman travels 20 meters upstream at a cost of 100 dollars. Profit so far: -100
  • He attends fair number 1 and earns 100. Profit so far: 0
  • He travels 5 meters upstream at a cost of 25. Profit so far: -25
  • He attends fair number 3 where he earns 150. Profit so far: 125
  • He travels 25 meters downstream to return home at a cost of 75. Profit at the end: 50

Note on grading

For a number of tests, worth a total of 60 points, no two fairs will be held on the same day.
For a number of tests, worth a total of 40 points, none of the numbers in the input will exceed 5000.
The tests where both of the above conditions hold are worth 15 points.
The tests where at least one of the two conditions holds are worth 85 points.

All Submissions
Best Solutions

Point Value: 30 (partial)
Time Limit: 3.00s
Memory Limit: 128M
Added: Jul 31, 2010

Languages Allowed:

Comments (Search)

It's quiet in here...