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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
//mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
//int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=2010;
int dx[]={1,0,-1,0}, dy[]={0,1,0,-1};
int n,m,k,dis[N][N],t;
PII q[N*N];
char s[N][N];

int main() {
	scanf("%d%d%d",&n,&m,&k);
	for (int i=0;i<n;i++) scanf("%s",s[i]);
	rep(i,0,n) rep(j,0,m) dis[i][j]=1<<30;
	dis[n-1][m-1]=0;
	q[t++]=mp(n-1,m-1);
	rep(i,0,t) {
		int x=q[i].fi,y=q[i].se;
		rep(d,0,4) {
			int px=x+dx[d],py=y+dy[d];
			if (px>=0&&px<n&&py>=0&&py<m&&s[px][py]=='.'&&dis[px][py]>dis[x][y]+1) {
				dis[px][py]=dis[x][y]+1;
				q[t++]=mp(px,py);
			}
		}
	}
	ll ans=1ll<<60,cnt=0;
	ll d=(dis[0][0]-(n+m-2))/2;
	rep(i,0,k) {
		ll a,b;
		scanf("%lld%lld",&a,&b);
		ll w=a*(n+m-2)+d*(a+b);
		if (w<ans) ans=w,cnt=0;
		if (w==ans) cnt++;
	}
	printf("%lld %lld\n",ans,cnt);
}