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
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
template<class T> int size(T &&x) {
	return int(x.size());
}
template<class A, class B> ostream& operator<<(ostream &out, const pair<A, B> &p) {
	return out << '(' << p.first << ", " << p.second << ')';
}
template<class T> auto operator<<(ostream &out, T &&x) -> decltype(x.begin(), out) {
	out << '{';
	for(auto it = x.begin(); it != x.end(); ++it)
		out << *it << (it == prev(x.end()) ? "" : ", ");
	return out << '}';
}
void dump() {}
template<class T, class... Args> void dump(T &&x, Args... args) {
	cerr << x << ";  ";
	dump(args...);
}
#ifdef DEBUG
  struct Nl{~Nl(){cerr << '\n';}};
# define debug(x...) cerr << (strcmp(#x, "") ? #x ":  " : ""), dump(x), Nl(), cerr << ""
#else
# define debug(...) 0 && cerr
#endif
mt19937_64 rng(0);
int rd(int l, int r) {
	return uniform_int_distribution<int>(l, r)(rng);
}
// end of templates

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n, m, k;
	cin >> n >> m >> k;
	auto board = vector<vector<char>>(n, vector<char>(m));
	REP(i, n) REP(j, m) cin >> board[i][j];

	auto dist = vector<vector<int>>(n, vector<int>(m, -1));
	dist[0][0] = 0;
	deque<pair<int, int>> q = {{0, 0}};
	while(size(q)) {
		auto [x, y] = q.front();
		q.pop_front();
		for(auto [i, j]: vector<pair<int, int>>{{x-1, y}, {x+1, y}, {x, y-1}, {x, y+1}}) 
			if(0 <= i and i < n and
			   0 <= j and j < m and
			   board[i][j] != 'X' and dist[i][j] == -1) {
				q.emplace_back(i, j);
				dist[i][j] = dist[x][y]+1;
			}
	}
	debug(dist);

	map<LL, int> mmap;
	LL best = LLONG_MAX;
	REP(i, k) {
		LL a, b;
		cin >> a >> b;
		LL score = a*(dist[n-1][m-1]+n+m-2)/2 + b*(dist[n-1][m-1]-n-m+2)/2;
		debug(score);
		if(mmap.find(score) == mmap.end()) mmap[score] = 0;
		mmap[score]++;
		best = min(best, score);
	}
	cout << best << ' ' << mmap[best] << '\n';
}