Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Walk
Description Alice would like to visit Bob. However, they live in a hilly landscape, and Alice doesn’t like to walk in hills. She has a map of the area, showing the height curves. You have to calculate the total altitude climbed, and the total altitude descended, for the route which minimizes these numbers. It does not matter how far she has to walk to achieve this. Since you don’t know what the landscape looks like in between the height curves, you cannot know exactly how much climb and descent she will actually get in practice, but you should calculate the minimum possible under optimal conditions based on what you can deduce from the map. The map is represented as an Second test case from sample input (compressed). Input On the first line one positive number: the number of testcases, at most 100. After that per testcase: One line with 0 ≤ *N*≤2 500 , the number of height curves.One line for each height curve, with 1 ≤ *H*≤_{i}1 000 being the height of the curve, 3 ≤*P*≤_{i}2 000 the number of vertices in the polygon, and the vertices*x*_{1},*y*_{1}, …,*x*,_{Pi}*y*having integral values_{Pi}−300 000 ≤*x*,_{i}*y*≤_{i}300 000 .
There will be no more than Output Per testcase: - One line with two numbers: the total altitude climbed and the total altitude descended.
Sample Input 2 2 20 3 10 10 0 -10 -10 10 25 3 20 20 0 -20 -20 20 3 100 4 -1 1 1 1 1 -1 -1 -1 300 8 -2 2 2 2 2 -2 5 -2 5 1 6 1 6 -3 -2 -3 50 8 3 3 100001 3 100001 -1 7 -1 7 2 4 2 4 -1 3 -1 Sample Output 5 0 200 250 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator