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
// Artur Kraska, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000000000000007LL

using namespace std;

int n, m, k;
char slowo[2007][2007];
bool byl[2007][2007];
list <pair<int, int>> l[2];

int main()
{
    scanf("%d %d %d", &n, &m, &k);
    forr(i, n)
        scanf("%s", slowo[i]);

    long long ile = 0;
    int curr = 0, opp = 1;
    l[curr].PB(MP(n-1, m-1));
    while(1)
    {
        if(l[curr].empty())
        {
            swap(curr, opp);
            ile++;
        }
        auto p = l[curr].front();
        l[curr].pop_front();

        if(p.ff == 0 && p.ss == 0)
            break;

        if(byl[p.ff][p.ss] || slowo[p.ff][p.ss] == 'X')
            continue;
        byl[p.ff][p.ss] = 1;

        if(p.ff > 0)
            l[curr].PB(MP(p.ff-1, p.ss));
        if(p.ss > 0)
            l[curr].PB(MP(p.ff, p.ss-1));
        if(p.ff < n-1)
            l[opp].PB(MP(p.ff+1, p.ss));
        if(p.ss < m-1)
            l[opp].PB(MP(p.ff, p.ss+1));
    }


    long long res = INF, iler = 0;
    forr(i, k)
    {
        int a, b;
        scanf("%d %d", &a, &b);
        long long r = a*(n+m-2 + ile) + b*ile;
        if(r < res)
        {
            res = r;
            iler = 1;
        }
        else if(r == res)
        {
            iler++;
        }
    }
    printf("%lld %lld\n", res, iler);

    return 0;
}