Submission #381348

#TimeUsernameProblemLanguageResultExecution timeMemory
381348jlallas384Bitaro the Brave (JOI19_ho_t1)C++17
100 / 100
286 ms56044 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    int n,m;
    cin >> n >> m;
    vector<string> g(n);
    for(auto &x: g){
        cin >> x;
    }
    vector<vector<int>> cnt(n+1,vector<int>(m));
    for(int i = n - 1; i >= 0; i--){
        for(int j = 0; j < m; j++){
            cnt[i][j] = cnt[i+1][j] + (g[i][j] == 'I');
        }
    }
    ll ans = 0;
    for(int i = 0; i < n; i++){
        int c = 0;
        for(int j = 0; j < m; j++){
            if(g[i][j] == 'J') c += cnt[i+1][j];
            if(g[i][j] == 'O') ans += c;
        }
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...