Submission #3445327

---

Source Code Expand

#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>

#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

typedef pair<int, int> P;

const int INF = 1e15;
const int MOD = 1e9+7;

signed main(){
    int h, w, a, b;
    cin >> h >> w >> a >> b;

    vector<vector<bool>> s(h, vector<bool>(w, false));
    int stone = 0;
    rep(i, h){
        rep(j, w){
            char c;
            cin >> c;
            if(c == 'S'){
                s[i][j] = true;
                stone++;
            }
        }
    }

    int hor, ver, hv;
    hor = ver = hv = 0;
    vector<vector<bool>> vpos(h, vector<bool>(w, false));
    vector<vector<bool>> hpos(h, vector<bool>(w, false));
    rep(i, h / 2){
        rep(j, w / 2){
            int x = 0, y = 0;
            if(s[i][j] && s[h-1-i][j]){
                vpos[i][j] = vpos[h-1-i][j] = true;
                x++;
            }
            if(s[i][w-1-j] && s[h-1-i][w-1-j]){
                vpos[i][w-1-j] = vpos[h-1-i][w-1-j] = true;
                x++;
            }
            if(s[i][j] && s[i][w-1-j]){
                hpos[i][j] = hpos[i][w-1-j] = true;
                y++;
            }
            if(s[h-1-i][j] && s[h-1-i][w-1-j]){
                hpos[h-1-i][j] = hpos[h-1-i][w-1-j] = true;
                y++;
            }
            if(x == 2){
                hv++;
            }
            ver += x;
            hor += y;
        }
    }

    //cout << ver << " " << hor << " " << hv << endl;

    if(ver * 2 == hv * 4){
        int ans = a + b;
        ans += (a + b) * hv + max(a, b) * hv;
        if(ver * 2 == stone){
            ans -= (a + b);
        }
        cout << ans << endl;
        return 0;
    }

    int ans1, ans2;
    ans1 = ans2 = a + b;
    ans1 += a * (ver - hv);
    ans1 += (a + b) * hv + max(a, b) * hv;
    ans2 += b * (hor - hv);
    ans2 += (a + b) * hv + max(a, b) * hv;
    if(ver * 2 == stone){
        ans1 -= a;
    }
    if(hor * 2 == stone){
        ans2 -= b;
    }
    cout << max(ans1, ans2) << endl;

    return 0;
}

Submission Info

Judge Result