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
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include <bits/stdc++.h>
using namespace std;
#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define LD long double
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define endl '\n'
#define ALL(c) (c).begin(), (c).end()
#define SIZ(c) (int)(c).size()
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i)
#define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i)
#define ll LL
#define st f
#define nd s
#define pb PB
#define mp MP
#define eb emplace_back
#define siz(c) SIZ(c)
const int inf = 1e9+7;
const ll INF = 1e18L+7;

#define sim template<class n
sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
sim> auto operator << (ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type 
{int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << endl;}
sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
sim, class s> void mini(n &p, s y) {if(p>y) p = y;}
sim, class s> void maxi(n &p, s y) {if(p<y) p = y;}
#ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
#else
#define debug(...)
#endif 

#define I(x) #x " =", (x), " "

#ifndef LOCAL
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

template <typename T>
using ordered_set =
	tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#else
#include</Users/dawid/algo/mac/ordered_set>
#endif

#define int ll
const int N = 2007;

int n, m, k;

int g[N][N];
int dist[N][N];

int X[] = {1, 0, -1, 0};
int Y[] = {0, 1, 0, -1};

deque<PII> Q;

bool ins(int x, int y) {
	return 1 <= x && x <= n && 1 <= y && y <= m && !g[x][y];
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);

	cin >> n >> m >> k;

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			char c;
			cin >> c;

			if (c == 'X')
				g[i][j] = 1;
		}
	}

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j)
			dist[i][j] = inf;
	}

	dist[1][1] = 0;
	Q.emplace_back(1, 1);

	while (!Q.empty()) {
		int x = Q.front().st;
		int y = Q.front().nd;
		Q.pop_front();

		debug(x, y, dist[x][y]);

		for (int i = 0; i < 2; ++i) {
			if (ins(x + X[i], y + Y[i]) && dist[x + X[i]][y + Y[i]] > dist[x][y]) {
				dist[x + X[i]][y + Y[i]] = dist[x][y];
				Q.emplace_front(x + X[i], y + Y[i]);
			}
		}

		for (int i = 2; i < 4; ++i) {
			if (ins(x + X[i], y + Y[i]) && dist[x + X[i]][y + Y[i]] > dist[x][y] + 1) {
				dist[x + X[i]][y + Y[i]] = dist[x][y] + 1;
				Q.emplace_back(x + X[i], y + Y[i]);
			}
		}
	}

	int down = dist[n][m];
	int up = n - 1 + m - 1 + down;

	int best = INF;
	int cnt = -1;

	while (k--) {
		int a, b;
		cin >> a >> b;
		int curr = up * a + down * b;

		if (curr == best)
			++cnt;
		else if (curr < best) {
			best = curr;
			cnt = 1;
		}
	}

	cout << best << " " << cnt << endl;
}