Submission #72575037

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=3005,INF=15<<26;

ll E[MAX][MAX],F[MAX][MAX],G[MAX][MAX];
int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll H,W;cin>>H>>W;
    vst S(H);
    for(int i=0;i<H;i++){
        cin>>S[i];
    }
    for(int h=0;h<H;h++){
        for(int w=0;w<W;w++){
            F[h][w+1]=F[h][w];
            if(S[h][w]=='F') F[h][w+1]++;
            G[h+1][w]+=G[h][w];
            if(S[h][w]=='G') G[h+1][w]++;
        }
    }
    for(int h=0;h<H;h++){
        for(int w=0;w<W;w++){
            if(S[h][w]=='E') E[h][w]=1;
            if(w) E[h][w]+=E[h][w-1];
        }
    }
    for(int w=0;w<W;w++){
        for(int h=1;h<H;h++) E[h][w]+=E[h-1][w];
    }
    
    ll ans=0;
    for(int h=1;h<H;h++){
        for(int w=1;w<W;w++){
            ans+=(F[h][W]-F[h][w+1])*(G[H][w]-G[h+1][w])*(E[h-1][w-1]);
            //cout<<ans<<endl;
        }
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result