Submission #1359220

#TimeUsernameProblemLanguageResultExecution timeMemory
1359220goshgar_468Bitaro the Brave (JOI19_ho_t1)C++20
100 / 100
63 ms10256 KiB
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

# define int long long
# define QR ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
# define endl '\n'
# define all(x) x.begin(), x.end()
# define ff first
# define ss second
# define pb push_back

const int INF = 1e18;

void CASE(){
    int n, m;
    cin >> n >> m;
    map<char, pair < int , int > > h, w;
    vector<string> s(n);
    for (int i = 0; i < n; i++){
        cin >> s[i];
    }
    vector<int> b(m, 0);
    int ans = 0;
    for (int i = n - 1; i >= 0; i--){
        int a = 0;
        for (int j = m - 1; j >= 0; j--){
            if (s[i][j] == 'I'){
                b[j]++;
            }
        }
        for (int j = m - 1; j >= 0; j--){
            if (s[i][j] == 'J'){
                ans += a * b[j];
            }
            if (s[i][j] == 'O'){
                a++;
            }
        }
    }
    cout << ans;
}

signed main() {
    QR;
    int TESTS = 1;
    // cin >> TESTS;
    for (int TEST = 1; TEST <= TESTS; TEST++) {
        // cout << "Case #TEST << ": " ;
        CASE();
    }
    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...