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
/// Radoslaw Mysliwiec 2020
#pragma GCC optimize("O3")
#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 F first
#define S second
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define endl '\n'
#define dd cout << " debug";

using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int,int>;
using pll = pair<ll,ll>;
using matrix = vector<vll>;
//using ordered_set = tree<pi, null_type, less<pi>, rb_tree_tag, tree_order_statistics_node_update>;

int n, m, k;
bool tab[2020][2020], vis[2020][2020];
int dist[2020][2020];

void bfs() {
    queue<pair<pair<int,int>,int>> q;
    q.push({{0,0}, 0});
    while (!q.empty()) {
        int row = q.front().F.F;
        int col = q.front().F.S;
        int d = q.front().S;
        q.pop();
        if (vis[row][col] || row < 0 || col < 0 || row >= n || col >= m)
            continue;
        dist[row][col] = d;
        vis[row][col] = true;
        q.push({{row+1,col}, d+1});
        q.push({{row-1,col}, d+1});
        q.push({{row,col+1}, d+1});
        q.push({{row,col-1}, d+1});
    }
}


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> m >> k;

    for (int i=0; i<n; ++i) {
        for (int j=0; j<m; ++j) {
            char tmp;
            cin >> tmp;
            if (tmp == 'X') 
                vis[i][j] = 1;
        }
    }

    bfs();

    ll DOL = (dist[n-1][m-1] - n - m + 2) / 2;
    ll GORA = dist[n-1][m-1] - DOL;
    pll res = {1e18, 0};

    while (k--) {
        ll a, b;
        cin >> a >> b;
        if (GORA*a + DOL*b == res.F) 
            ++res.S;
        else if (GORA*a + DOL*b < res.F) {
            res.F = GORA*a + DOL*b;
            res.S = 1;
        }
    }

    cout << res.F << ' ' << res.S << endl;

}