1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// debug & operator << (debug & dd, P p) { dd << "(" << p.x << ", " << p.y << ")"; return dd; }

const int nax = 2005;
char grid[nax][nax];
int dist[nax][nax];

const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};

int main() {
	int h, w, k;
	scanf("%d%d%d", &h, &w, &k);
	for(int row = 0; row < h; ++row) {
		scanf("%s", grid[row]);
	}
	dist[0][0] = 1;
	vector<pair<int,int>> q;
	q.emplace_back(0, 0);
	for(int i = 0; i < (int) q.size(); ++i) {
		int row = q[i].first;
		int col = q[i].second;
		for(int dir = 0; dir < 4; ++dir) {
			int r2 = row + dx[dir];
			int c2 = col + dy[dir];
			if(0 <= r2 && r2 < h && 0 <= c2 && c2 < w && !dist[r2][c2] && grid[row][col] != 'X') {
				dist[r2][c2] = dist[row][col] + 1;
				q.emplace_back(r2, c2);
			}
		}
	}
	int d = dist[h-1][w-1] - 1 - (h - 1) - (w - 1);
	debug() << imie(d);
	assert(d % 2 == 0);
	int a = h - 1 + w - 1 + d / 2;
	int b = d / 2;
	debug() << imie(a) imie(b);
	pair<long long, int> answer = make_pair(LONG_LONG_MAX, 0);
	for(int i = 1; i <= k; ++i) {
		int x, y;
		scanf("%d%d", &x, &y);
		long long score = 1LL * a * x + 1LL * b * y;
		// debug() << imie(score);
		if(answer.first > score) {
			answer.first = score;
			answer.second = 1;
		}
		else if(answer.first == score) {
			answer.second++;
		}
		// answer = min(answer, make_pair(, i));
	}
	printf("%lld %d\n", answer.first, answer.second);
}