hdu4362

Dragon Ball

Time Limit : 3000/1500ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 2   Accepted Submission(s) : 2

Problem Description

Sean has got a Treasure map which shows when and where the dragon balls will appear. some dragon balls will appear in a line at the same time for each period.Since the time you got one of them,the other dragon ball will disappear so he can only and must get one Dragon ball in each period.Digging out one ball he will lose some energy.Sean will lose |x-y| energy when he move from x to y.Suppose Sean has enough time to get any drogan ball he want in each period.We want to know the minimum energy sean will lose to get all period’s dragon ball.

 

Input

In the first line a number T indicate the number of test cases.Then for each case the first line contain 3 numbers m,n,x(1<=m<=50,1<=n<=1000),indicate m period Dragon ball will appear,n dragon balls for every period, x is the initial location of sean.Then two m*n matrix. For the first matrix,the number in I row and J column indicate the location of J-th Dragon ball in I th period.For the second matrix the number in I row and J column indicate the energy sean will lose for J-th Dragon ball in I-th period.

 

Output

For each case print a number means the minimum energy sean will lose.

 

Sample Input

  
  

   
   1
3 2 5
2 3
4 1
1 3
1 1
1 3
4 2
  
  

 

Sample Output

  
  

   
   8
  
  

 

Author

FZU

 

Source

2012 Multi-University Training Contest 7

分析：

dp[i][j] = min { dp[i-1][k] + pos[i][j] - pos[i-1][k] } + cost[i][j]

         = min { dp[i-1][k] - pos[i-1][k] } + pos[i][j] + cost[i][j]dp[i][j] = min { dp[i-1][k] + pos[i-1][k] - pos[i][j] } + cost[i][j]

         = min { dp[i-1][k] + pos[i-1][k] } - pos[i][j] + cost[i][j]

对于此题，这个是关键，因为DP方程很好想就不做叙述了。。

然后对于pos[i][j]和cost[i][j]排序，作为一个结构体排序，按pos从小到大，然后从小遍历以及从大遍历两次。。