Uolevin kalansaalis

input/code.cpp: In function 'void solve()':
input/code.cpp:88:40: error: 'a1' was not declared in this scope; did you mean 'a_1'?
   88 |             pair<int, int> a_1_0 = adj(a1, 0);
      |                                        ^~
      |                                        a_1
input/code.cpp: In function 'std::pair<int, int> adj(std::pair<int, int>, int)':
input/code.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
   47 | }
      | ^

#pragma GCC target("avx2")
#pragma GCC optimize("O3")

#include <bits/stdc++.h>

using namespace std;

void init_code() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}

vector<pair<int, int>> adj(pair<int, int> cell) {
    vector<pair<int, int>> res;
    int i = cell.first, j = cell.second;
    if (i % 2 == 0) {
        res = {{i, j - 1}, {i - 1, j}, {i - 1, j + 1}, {i, j + 1}, {i + 1, j + 1}, {i + 1, j}};
    } else {
        res = {{i, j - 1}, {i - 1, j - 1}, {i - 1, j}, {i, j + 1}, {i + 1, j}, {i + 1, j - 1}};
    }
 
    return res;
}


inline pair<int, int> adj(pair<int, int> cell, int idx) {
    int i = cell.first, j = cell.second;
    if (i % 2 == 0) {
        if (idx == 0) return {i, j - 1};
        if (idx == 1) return {i - 1, j};
        if (idx == 2) return {i - 1, j + 1};
        if (idx == 3) return {i, j + 1};
        if (idx == 4) return {i + 1, j + 1};
        if (idx == 5) return {i + 1, j};
    }

    if (idx == 0) return {i, j - 1};
    if (idx == 1) return {i - 1, j - 1};
    if (idx == 2) return {i - 1, j};
    if (idx == 3) return {i, j + 1};
    if (idx == 4) return {i + 1, j};
    if (idx == 5) return {i + 1, j - 1};   
}

inline bool ok(pair<int, int> cell, int n, int m) {
    return cell.first >= 1 && cell.first <= n && cell.second >= 1 && cell.second <= m;
}

const int inf = 1e9 + 1;
void solve() {
    int n, m, k;
    cin >> n >> m >> k;

    vector<vector<int>> g(n + 1, vector<int> (m + 1, 0)); 
    
    int s = 0;
    for (int i = 1; i <= k; ++i) {
        int a, b;
        cin >> a >> b;
        char c;
        cin >> c;

        if (c == 'H') {
            g[a][b] = 1;
        } else {
            g[a][b] = -10;
        }

        s += g[a][b];
    }

    vector<vector<int>> p1(n + 1, vector<int> (m + 1, 0));

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {

            p1[i][j] += g[i][j];
            

            if (ok({i, j - 1}, n, m))
                p1[i][j] += p1[i][j - 1];

            pair<int, int> a_1 = adj({i, j}, 1);
            pair<int, int> a_1_0 = adj(a1, 0);
            if (ok(a_1, n, m))
                p1[i][j] += p1[a_1.first][a_1.second];
            
            if (ok(a_1_0, n, m))
                p1[i][j] -= p1[a_1_0.first][a_1_0.second - 1];
        }
    }
    
    vector<vector<int>> p2(n + 1, vector<int> (m + 1, 0));

    for (int i = 1; i <= n; ++i) {
        for (int j = m; j >= 1; --j) {
            vector<pair<int, int>> adjs = adj({i, j});
            
            p2[i][j] += g[i][j];
            
            if (ok(adjs[2], n, m))
                p2[i][j] += p2[adjs[2].first][adjs[2].second];

            if (ok(adjs[3], n, m))
                p2[i][j] += p2[adjs[3].first][adjs[3].second];
            
            if (ok({adjs[2].first, adjs[2].second + 1}, n, m))
                p2[i][j] -= p2[adjs[2].first][adjs[2].second + 1];
        }
    }

    vector<vector<int>> p3(n + 1, vector<int> (m + 1, 0));

    for (int i = n; i >= 1; --i) {
        for (int j = 1; j <= m; ++j) {
            vector<pair<int, int>> adjs = adj({i, j});
            
            p3[i][j] += g[i][j];
            
            if (ok(adjs[0], n, m))
                p3[i][j] += p3[adjs[0].first][adjs[0].second];

            if (ok(adjs[5], n, m))
                p3[i][j] += p3[adjs[5].first][adjs[5].second];
            
            if (ok({adjs[5].first, adjs[5].second - 1}, n, m))
                p3[i][j] -= p3[adjs[5].first][adjs[5].second - 1];
        }
    }

    vector<vector<int>> p4(n + 1, vector<int> (m + 1, 0));

    for (int i = n; i >= 1; --i) {
        for (int j = m; j >= 1; --j) {
            vector<pair<int, int>> adjs = adj({i, j});
            
            p4[i][j] += g[i][j];
            
            if (ok(adjs[3], n, m))
                p4[i][j] += p4[adjs[3].first][adjs[3].second];

            if (ok(adjs[4], n, m))
                p4[i][j] += p4[adjs[4].first][adjs[4].second];
            
            if (ok({adjs[4].first, adjs[4].second + 1}, n, m))
                p4[i][j] -= p4[adjs[4].first][adjs[4].second + 1];
        }
    }
    
    vector<int> p0(n + 1), p5(n + 2);
    for (int i = 1; i <= n; ++i) {
        p0[i] += p0[i - 1];
        for (int j = 1; j <= m; ++j) {
            p0[i] += g[i][j];
        }

        p5[n - i + 1] += s - p0[i - 1];
    }

    int mn = inf;
    for (int t = 1; t <= min(n, m); ++t) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                //up
                int ux1 = i + t - 1, uy1, ux2 = i + t - 1, uy2;
                if (i % 2 == 1) {
                    uy2 = j + (t - 1) / 2;
                    uy1 = uy2 - (t - 1); 
                } else {
                    uy1 = j - (t - 1) / 2;
                    uy2 = uy1 + (t - 1);
                }
                if (ok({ux1, uy1}, n, m) && ok({ux2, uy2}, n, m)) {
                    int tmp = s;
                    tmp -= p0[i - 1];
                    tmp -= p5[n - ux1];
                    vector<pair<int, int>> a0 = adj({i, j}), a1 = adj({ux1, uy1}), a2 = adj({ux2, uy2});
                    vector<pair<int, int>> a_a1 = adj(a1[0]), a_a2 = adj(a2[3]);
                    int x = 0;
                    if (ok(a0[0], n, m)) {
                        x += p3[a0[0].first][a0[0].second];
                    }
                    if (ok(a_a1[5], n, m)) {
                        x -= p3[a_a1[5].first][a_a1[5].second];
                    }
                    tmp -= x;

                    int y = 0;
                    if (ok(a0[3], n, m)) {
                        y += p4[a0[3].first][a0[3].second];
                    }
                    if (ok(a_a2[4], n, m)) {
                        y -= p4[a_a2[4].first][a_a2[4].second];
                    }

                    tmp -= y;
                    //cout << t << ' ' << ux1 << ' ' << uy1 << ' ' << tmp << '\n'; 
                    mn = min(mn, tmp);
                }


                //down
                int px1 = i - (t - 1), py1, px2 = i - (t - 1), py2;
                if (i % 2 == 1) {
                    py2 = j + (t - 1) / 2;
                    py1 = py2 - (t - 1); 
                } else {
                    py1 = j - (t - 1) / 2;
                    py2 = py1 + (t - 1);
                }

                if (ok({px1, py1}, n, m) && ok({px2, py2}, n, m)) {
                    int tmp = s;
                    tmp -= p0[px1 - 1];
                    tmp -= p5[n - i];
                    
                    vector<pair<int, int>> a0 = adj({i, j}), a1 = adj({px1, py1}),
                    a2 = adj({px2, py2});
                    vector<pair<int, int>> a_a1 = adj(a1[0]), a_a2 = adj(a2[3]);
                    
                    int x = 0;
                    if (ok(a0[0], n, m)) {
                        x += p1[a0[0].first][a0[0].second];
                    }
                    if (ok(a_a1[1], n, m)) {
                        x -= p1[a_a1[1].first][a_a1[1].second];
                    }
                    tmp -= x;

                    int y = 0;
                    if (ok(a0[3], n, m)) {
                        y += p2[a0[3].first][a0[3].second];
                    }
                    if (ok(a_a2[2], n, m)) {
                        y -= p2[a_a2[2].first][a_a2[2].second];
                    }

                    tmp -= y;
                    //cout << t << ' ' << ux1 << ' ' << uy1 << ' ' << tmp << '\n'; 
                    mn = min(mn, tmp);
                }
            }   
        }
    }

    cout << s - mn << '\n';
}

signed main() {
  init_code();
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}