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
#include <bits/stdc++.h>
 
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef pair<int,int> PI; 
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;
typedef pair<double,double> PD;
 
#define FOR(x, b, e) for(int x = b; x<= (e); x++)
#define FORD(x, b, e) for(int x = b; x>= (e); x--)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
 
#define PB push_back
#define IN insert
#define ST first
#define ND second
#define INF 2000000011
#define MOD 1000000007

#define MAXS 2010

int mapa[MAXS][MAXS];
int odl[MAXS][MAXS];

int n,m,k;

bool inBounds(PI coords){
    int x=coords.ST;
    int y=coords.ND;
    return x>=0&&x<n&&y>=0&&y<m&&odl[x][y]==INF&&mapa[x][y]==0;
}

int main(){
    
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin>>n>>m>>k;

    REP(i,n){
        string s1;
        cin>>s1;
        REP(j,m)
            mapa[i][j]=(s1[j]=='X');
    }

    REP(i,n){
        REP(j,m)
            odl[i][j]=INF;
    }

    queue<PI> kol;
    kol.push({0,0});
    odl[0][0]=0;

    while(odl[n-1][m-1]==INF){
        PI coords=kol.front();
        kol.pop();

        int x=coords.ST;
        int y=coords.ND;

        for(int p=-1;p<=1;p+=2){
            if(inBounds({x+p,y})){
                odl[x+p][y]=odl[x][y]+1;
                kol.push({x+p,y});
            }
            if(inBounds({x,y+p})){
                odl[x][y+p]=odl[x][y]+1;
                kol.push({x,y+p});
            }
        }
    }

    int wdol=(odl[n-1][m-1]-(n+m-2))/2;
    int wgore=n+m-2+wdol;
    LL wyn=LONG_LONG_MAX;
    int ile=0;

    REP(i,k){
        LL t1,t2;
        cin>>t1>>t2;
        LL val=wgore*t1+wdol*t2;
        if(val<wyn){
            wyn=val;
            ile=0;
        }
        if(wyn==val)
            ile++;
    }
    cout<<wyn<<" "<<ile<<"\n";
}