Uolevin kalansaalis

input/code.cpp: In function 'll scan(ll, bool)':
input/code.cpp:114:20: error: no matching function for call to 'min(int&, ll&)'
  114 |             p = min(s,p);
      |                 ~~~^~~~~
In file included from /usr/include/c++/11/bits/char_traits.h:39,
                 from /usr/include/c++/11/ios:40,
                 from /usr/include/c++/11/istream:38,
                 from /usr/include/c++/11/sstream:38,
                 from /usr/include/c++/11/complex:45,
                 from /usr/include/c++/11/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
                 from input/code.cpp:1:
/usr/include/c++/11/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)'
  230 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/11/bits/stl_algobase.h:230:5: note:   template argument deduction/substitution failed:
input/code.cpp:114:20: note:   deduced conflicting types...

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
 
struct Hex {       
  public:            
    ll l = 0;   
    ll r = 0;
};
 
const ll SIZE = 555;
 
ll n, m, k;
ll v[SIZE][SIZE];
ll v2[SIZE][SIZE];
Hex d[SIZE][SIZE];
 
ll count_l_colum(ll i, ll j, ll l){
    bool add = (i % 2 == 0);
    return (d[i][j].l - d[i-l][j - ll(ceil((l-add)/2.0))].l);
} 
 
ll count_r_colum(ll i, ll j, ll l){
    bool add = (i % 2 == 0);
    return (d[i][j].r - d[i-l][j + ll(floor((l+add)/2.0))].r);
} 
 
ll scan(ll p, bool skip1){
    for (ll i = n; i > 1; i--) {
        if(skip1 && (i == 1)){
            break;
        }
        ll h = i - skip1;
 
        ll j2 = 1;
        ll j1 = 1;
 
        ll l = 1;
 
        ll ms = d[i][1].l - d[i-1][(i % 2 == 0)].l; 
        ll s = ms;
 
        ll safety = 0;
        while (j1 < m)
        {
 
            safety++;
            // if(s == 0){
            //     cout << "HEI" << endl;
            // }
            // if(s == 1){
            //     cout << "I" << endl;
            // }
            p = min(s, p);
 
            if(j2 < j1+h - 1 && j2 < m){
                j2++;
                ms += count_l_colum(i, j2, (j2-j1 + 1));
                continue;
            }
 
            //else
            if((ms - s) < 0){
                l++;
                s += count_l_colum(i, (j1+l-1), l);
                continue;
            }
 
            //else
            if((ms - s) >= 0 && j1 < j2 && l > 1){
                s -= count_r_colum(i, j1, l);
                ms -= count_r_colum(i, j1, (j2-j1 + 1));
                j1++;
                l--;
                continue;
            }
            else if (j2 >= m){
                break;
            }
            else
            {
                s -= count_r_colum(i, j1, l);
                ms -= count_r_colum(i, j1, (j2-j1 + 1));
                j1++;
 
                j2++;
                s += count_l_colum(i, (j1+l-1), l);
                ms += count_l_colum(i, j2, (j2-j1 + 1));
                continue;
            }
        }
        // if(s == 0){
        //     cout << "MOI" << endl;
        // }
        // if(s == 1){
        //     cout << "J" << endl;
        // }
 
 
        
        p = min(s, p);
 
 
        
      
 
    }     
    if(!skip1){
        int s = 0;
        for (int j = 1; j <= m; j++)
        {
            s = d[1][j].l;
            p = min(s,p);
        }
    }
    return p;   
}
 
 
int main() {
    // freopen("input.txt", "r", stdin);
 
 
 
    cin >> n >> m >> k;
 
    ll a, b;
    char c;
    ll os = 0;
    for (ll i = 0; i < k; i++) {
        cin >> a >> b >> c;
        if(c == 'H'){
            v[a][b] = 1;
            os += 1;
        }else{
            v[a][b] = -10;
            os -= 10;
        }
    }
 
 
    for (ll i = 1; i <= n; i++) {
        for (ll j = 1; j <= m; j++) {
            bool add = 0;
            if(i % 2 == 0){
                add = 1;
            }
            d[i][j].l = v[i][j] + d[i-1][j-1+add].l;
            d[i][j].r = v[i][j] + d[i-1][j+add].r;
        }
    }
 
    // for (ll i = 1; i <= n; i++) {
    //     for (ll j = 1; j <= m; j++) {
            // cout << "(" << d[i][j].l << " ; " << d[i][j].r << ")  " ;
    //     }
        // cout << "\n";
    // }
 
    ll p = 1e9;
    p = scan(p,false);
 
    // cout << p << endl;
    // cout << os << endl;
    // assert(p >= os);
    // cout << "\n\n";
    bool fix = (n%2 == 0);
    n = n + fix;
    for (ll i = 1; i <= n; i++) {
        for (ll j = 1; j <= m; j++) {
            if(v[i][j] != 0){
                v2[n+1-i][j] = v[i][j];
            }
        }
    }
 
 
    for (ll i = 1; i <= n; i++) {
        for (ll j = 1; j <= m; j++) {
            bool add = 0;
            if(i % 2 == 0){
                add = 1;
            }
            d[i][j].l = v2[i][j] + d[i-1][j-1+add].l;
            d[i][j].r = v2[i][j] + d[i-1][j+add].r;
        }
    }
    
    // for (ll i = 1; i <= n; i++) {
    //     for (ll j = 1; j <= m; j++) {
    //         cout << "(" << d[i][j].l << " ; " << d[i][j].r << ")  " ;
    //     }
    //     cout << "\n";
    // }
 
    p = min(scan(p, fix), p);
 
    // assert((n <= 5 && m <= 5));
    // assert(p != 1e9);
    cout << os - p;
 
}