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
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                    \
    sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \
    {
sim > struct rge
{
    c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug
{
#ifdef XOX
    ~debug()
    {
        cerr << endl;
    }
    eni(!=) cerr << boolalpha << i;
    ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
    ris << "" << d.first << " --> " << d.second << "";
}
sim dor(rge<c> d)
{
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c &)
    {
        ris;
    }
#endif
}
;
#define imie(...) "" << #__VA_ARGS__ " = " << (__VA_ARGS__) << ", "

#define F first
#define S second
#define endl '\n'
#define pb emplace_back
#define mp make_pair
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b) / gcd(a, b)
#define all(v) (v).begin(), (v).end()
#define lb(v, val) (lower_bound((v).begin(), (v).end(), val) - (v).begin())
#define ub(v, val) (upper_bound((v).begin(), (v).end(), val) - (v).begin())
#define fast                      \
    ios_base::sync_with_stdio(0); \
    cin.tie();                    \
    cout.tie()
#define vt vector
#define sz(v) (int)(v).size()
using ll = long long;
using pii = pair<int, int>;

typedef tree<
    int,
    null_type,
    less<int>,
    rb_tree_tag,
    tree_order_statistics_node_update>
    oset;

const int oo = 1e9;

int main()
{
    fast;
    int n, m, k;
    ll a, b;
    cin >> n >> m >> k;
    vt<char> grid(n * m);
    for (char &ch : grid)
        cin >> ch;
    auto bfs = [&](int st) {
        vt<int> d(n * m, oo);
        d[st] = 0;
        deque<int> q;
        q.push_front(st);
        while (!q.empty())
        {
            int v = q.front();
            q.pop_front();
            auto can = [&](int from, int to) {
                if ((from + 1) % m == 0 and to == from + 1)
                    return false;
                if ((from) % m == 0 and to == from - 1)
                    return false;
                return true;
            };
            vt<pii> poss = {{v + m, 0}, {v - m, 1}};
            if (can(v, v + 1))
                poss.pb(v + 1, 0);
            if (can(v, v - 1))
                poss.pb(v - 1, 1);
            for (auto &[u, w] : poss)
            {
                if (u < 0 || u > n * m - 1 || grid[u] == 'X')
                    continue;
                if (d[v] + w < d[u])
                {
                    d[u] = d[v] + w;
                    if (w == 1)
                        q.push_back(u);
                    else
                        q.push_front(u);
                }
            }
        }
        return d[n * m - 1];
    };
    ll ile = bfs(0);
    debug() << imie(ile);
    ll need = n - 1 + m - 1;
    map<ll, int> mapka;
    while (k--)
    {
        cin >> a >> b;
        mapka[ile * (a + b) + a * need]++;
    }
    debug() << imie(mapka);
    auto [val, cnt] = *mapka.begin();
    cout << val << " " << cnt;
}