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
#include <bits/stdc++.h>
using namespace std;
#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define LD long double
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define endl '\n'      // UWAGA
#define ALL(c) (c).begin(), (c).end()
#define SIZ(c) (int)(c).size()
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i)
#define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i)
#define random_shuffle(V) shuffle(V, rng)

#define sim template<class n
sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
sim> auto operator << (ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type 
{int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << endl;}
sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
sim, class s> void mini(n &p, s y) {if(p>y) p = y;}
sim, class s> void maxi(n &p, s y) {if(p<y) p = y;}
#ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
#else
#define debug(...)
#endif 

#define I(x) #x " =", (x), " "
#define A(a, i) #a "[" #i " =", i, "] =", a[i], " "

mt19937 rng((unsigned int)chrono::steady_clock::now().time_since_epoch().count());
int R(int a, int b) {return (int)(rng()%(b-a+1)) + a;}
// #pragma GCC optimize("Ofast")
// while (clock()<=69*CLOCKS_PER_SEC)

const int MXN = 1e6+6;
int n, m;
char in[2005][2005];
int odl[2002][2002];
int a[MXN];
int b[MXN];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int cost(int i, int mode)
  {
  return (i <= 1) ^ mode;
  }

void calc(int a, int b, int mode)
  {
  FOR(i, 1, n)
    FOR(j, 1, m)
      odl[i][j] = 1e9;

  queue<PII> q;

  function<void(int, int)> dfs = [&](int a, int b)
    {
    REP(i, 4)
      {
      int na = a + dx[i];
      int nb = b + dy[i];
      if(in[na][nb] != '.')continue;
      int od = odl[a][b] + cost(i, mode);
      
      if(odl[na][nb] > od)
        {
        odl[na][nb] = od;
        q.push(MP(na, nb));
        if(cost(i, mode) == 0)dfs(na, nb);
        }
      }
    };

  q.push(MP(a, b));
  dfs(a, b);
  odl[a][b] = 0;
  while(q.size())
    {
    a = q.front().f;
    b = q.front().s;
    q.pop();
    dfs(a, b);
    }
  }

int main()
  {
  ios_base::sync_with_stdio(0);
  int k;
  cin >> n >> m >> k;
  FOR(i, 1, n)
    FOR(j, 1, m)
      cin >> in[i][j];

  calc(1, 1, 0);
  int res1a = odl[n][m];
  int res1b = res1a - (n - 1 + m - 1);

  calc(1, 1, 1);
  int res2b = odl[n][m];
  int res2a = (n - 1 + m - 1) + res2b;

  debug(res1a, res1b);
  debug(res2a, res2b);

  LL res = 1e18;
  int cnt = 0;
  FOR(i, 1, k)
    {
    cin >> a[i] >> b[i];
    LL act1 = (LL)a[i] * res1a + (LL)b[i] * res1b;
    LL act2 = (LL)a[i] * res2a + (LL)b[i] * res2b;
    LL act = min(act1, act2);
    if(act < res)
      {
      res = act;
      cnt = 0;
      }
    if(act == res)cnt++;
    }
  cout << res << " " << cnt << endl;
  }