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
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

template<typename _T> inline void _DBG(const char *s, _T x) { cerr << s << " = " << x << "\n"; }
template<typename _T, typename... args> void _DBG(const char *s, _T x, args... a) { while(*s != ',') cerr << *s++; cerr << " = " << x << ','; _DBG(s + 1, a...); }

#ifdef LOCAL
#define _upgrade ios_base::sync_with_stdio(0);
#define DBG(...) _DBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define _upgrade ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define DBG(...) (__VA_ARGS__)
#define cerr if(0) cout
#endif

// ********************** CODE ********************** //

const int N = 2007;

int n, m, k, dist[N][N];
char s[N][N];

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

int BFS(int sx, int sy)
{
    queue<PII> Q;
    Q.push({sx, sy});
    dist[sx][sy] = 1;

    while(!Q.empty())
    {
        int x = Q.front().first, y = Q.front().second;
        Q.pop();
        for(int i = 0; i < 4; i++)
        {
            int ux = x + dx[i], uy = y + dy[i];
            if(s[ux][uy] != 'X' && dist[ux][uy] == 0)
            {
                dist[ux][uy] = dist[x][y] + 1;
                Q.push({ux, uy});
            }
        }
    }

    return dist[n][m] - 1;
}

int main()
{
    _upgrade
    
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++)
        cin >> (s[i] + 1);
    for(int i = 0; i <= n + 1; i++)
        s[i][0] = s[i][m + 1] = 'X';
    for(int i = 0; i <= m + 1; i++)
        s[0][i] = s[n + 1][i] = 'X';

    int d = BFS(1, 1);
    LL b = (d - (n + m - 2)) / 2, a = d - b;

    LL ans = 1e18;
    int cnt = 0;
    while(k--)
    {
        LL x, y;
        cin >> x >> y;
        LL tmp = a * x + b * y;
        if(tmp < ans)
            ans = tmp, cnt = 1;
        else if(tmp == ans)
            cnt++;
    }
    cout << ans << " " << cnt << "\n";

    return 0;
}