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
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define e1 first
#define e2 second
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define float long double
#define size(x) (int)x.size()
#define satori int testCases; cin>>testCases; while(testCases--)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define all(r) begin(r),end(r)
#define time chrono::high_resolution_clock().now().time_since_epoch().count()
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
mt19937 rng(chrono::high_resolution_clock().now().time_since_epoch().count());
///////////////////
#define debug if(1)
///////////////////

const int MAXN=2e3+10,inf=1e9+2137;

const ll big_inf=1e18+2137;

int n,m;
int d[MAXN][MAXN];
string s[MAXN];

deque<pair<int,int>> dq;

int32_t main()
{
	fastio;
	int k;
	cin>>n>>m>>k;
	for(int i=0;i<n;i++){
		cin>>s[i];
		fill(d[i],d[i]+m,inf);
	}
	d[0][0]=0;
	dq.push_front(mp(0,0));
	while(size(dq)){
		int x=dq.front().e1,y=dq.front().e2;
		dq.pop_front();
		if(x+1<n&&d[x][y]<d[x+1][y]&&s[x+1][y]!='X')
			d[x+1][y]=d[x][y],dq.push_front(mp(x+1,y));
		if(y+1<m&&d[x][y]<d[x][y+1]&&s[x][y+1]!='X')
			d[x][y+1]=d[x][y],dq.push_front(mp(x,y+1));
		if(x-1>=0&&d[x][y]+1<d[x-1][y]&&s[x-1][y]!='X')
			d[x-1][y]=d[x][y]+1,dq.push_back(mp(x-1,y));
		if(y-1>=0&&d[x][y]+1<d[x][y-1]&&s[x][y-1]!='X')
			d[x][y-1]=d[x][y]+1,dq.push_back(mp(x,y-1));
	}
	ll aco=n+m-2+d[n-1][m-1],bco=d[n-1][m-1];
	ll fast=big_inf;
	int cnt=0;
	for(int i=0;i<k;i++){
		ll a,b;
		cin>>a>>b;
		ll cost=a*aco+b*bco;
		if(cost<fast)
			fast=cost,cnt=1;
		else
		if(cost==fast)
			cnt++;
	}
	cout<<fast<<' '<<cnt<<'\n';
}