Submission #161155

#TimeUsernameProblemLanguageResultExecution timeMemory
161155pr3ponyBitaro the Brave (JOI19_ho_t1)C++14
100 / 100
84 ms54524 KiB
#include<bits/stdc++.h>
using namespace std;
const int N = 3087;
char g[N][N];
int si[N][N];
int n,m;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; ++i)
        cin >> g[i];
    long long ans = 0;
    for (int i = n-1; i >= 0; --i) {
        int so = 0;
        for (int j = m-1; j >= 0; --j) {
            so += g[i][j] == 'O';
            si[i][j] = (g[i][j] == 'I') + si[i+1][j];
            ans += (g[i][j] == 'J') * so * 1ll * si[i][j];
        }
    }
    cout << ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...