COCI '08 Contest 6 #5 Dostava

View as PDF

Submit solution

Points: 17 (partial)
Time limit: 2.0s
Memory limit: 128M

Problem types

Little Ivica recently got a job delivering pizzas for the most popular pizzeria in town.

At the start of his workday, he receives a list with the locations to which he needs to deliver pizzas, in order in which the locations are given.

The city is divided into R \times C cells. The rows are numbered 1 through R, columns 1 through C. From every cell, it is possible to move to neighbouring cells to the left and right. Moving up or down is only allowed in the first and last columns (columns 1 and C).

The pizzeria is in the top left corner (1, 1) and this is the location Ivica starts from. Ivica takes with him all the pizzas he will deliver that day so he does not have to return to the pizzeria between deliveries or after the last delivery.

For each location in the city, Ivica knows how much time he will spend every time he is in it (trying to get through the intersection, for example).

Write a program that calculates the smallest amount of time for Ivica to deliver all the pizzas.

Input Specification

The first line contains the integers R and C (1 \le R \le 2000, 1 \le C \le 200), the dimensions of the city. Each of the following R lines contains C integers. These are the times Ivica spends every time he enters a location. The times will be integers between 0 and 5000, inclusive.

The next line contains an integer D (1 \le D \le 200\,000), the number of pizza deliveries that day. (No, it's not unrealistically large at all.)

Each of the following D lines contains two integers A and B (1 \le A \le R, 1 \le B \le C), the location to which a pizza must be delivered. The pizzas are given in the order in which they must be delivered. No location will be given twice in a row.

Output Specification

Output the smallest amount of time for Ivica to deliver all the pizzas.


In test cases worth 70\% of points, R will be at most 250.

Sample Input 1

3 3
1 8 2
2 3 2
1 0 1
1 3
3 3
2 2

Sample Output 1


Sample Input 2

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

Sample Output 2


In the first example, the shortest path goes through the following locations: (1, 1), (2, 1), (3, 1), (3, 2), (3, 3), (2, 3), (1, 3), (2, 3), (3, 3), (2, 3) and (2, 2). The locations in bold show where Mirko made deliveries. The total time for the deliveries is 1+2+1+0+1+2+2+2+1+2+3=17.


There are no comments at the moment.