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
84
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <random>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <climits>
#include <stack>
#include <random>
#include <bitset>
#include <numeric>
#include <cassert>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(x, b, e) for(int x=(b); x<(e); ++x)
#define trav(a, x) for(auto& a : x)
#define ford(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define all(c) c.begin(),c.end()
#define sz(x) ((int)((x).size()))
#define pb push_back
#define st first
#define nd second
#define mp(x,y) make_pair(x,y)
typedef short int sint;

#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

const int N = 2020;
char t[N][N];
int dx[]={1,-1,0,0};
int dy[]={0,0,-1,1};

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n, m, k;
	scanf("%d %d %d", &n, &m, &k);
	rep(i, 0, n) {
		scanf("%s", t[i]);
	}
	queue<pii> q;
	vector<vi> d(n, vi(m, INT_MAX));
	q.push({0, 0});
	d[0][0] = 0;
	auto ok = [&](int x, int y) {
		return x>=0 && x < n && y >= 0 && y < m;
	};
	while (!q.empty()) {
		auto c = q.front(); q.pop();
		rep(i, 0, 4) {
			int nx = c.st + dx[i], ny = c.nd + dy[i];
			if (ok(nx, ny) && t[nx][ny] == '.' && d[nx][ny] == INT_MAX) {
				d[nx][ny] = d[c.st][c.nd] + 1;
				q.push({nx, ny});
			}
		}
	}
	int c = d[n - 1][m - 1];
	int ra = (n + m - 2  + c) / 2;
	int rb = c - ra;
	ll fast = LLONG_MAX;
	int ile = 0;
	rep(i, 0, k) {
		ll a, b;
		scanf("%lld %lld", &a, &b);
		ll czas = a * ra + b * rb;
		if (czas < fast) {
			ile = 1;
			fast = czas;
		} else if (czas == fast) {
			++ile;
		}
	}
	printf("%lld %d\n", fast, ile);
}