Submission #947219

#	Time	Username	Problem	Language	Result	Execution time	Memory
947219		devkudawla	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	355 ms	89496 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
void solve(bool testCases = true) {
    int T = 1;
    if (testCases) cin >> T;
    while (T--) {
        int n, m;
        cin >> n >> m;
        vector<string> v(n);
        for (int i = 0; i < n; i++) {
            cin >> v[i];
        }
        int r[n][m] = {0};
        memset(r, 0, sizeof(r));
        for (int i = 0; i < n; i++) {
            for (int j = m - 2; j >= 0; j--) {
                r[i][j] += r[i][j + 1];
                if (v[i][j + 1] == 'O') {
                    r[i][j]++;
                }
            }
        }
        int c[n][m] = {0};
        memset(c, 0, sizeof(c));
        for (int j = 0; j < m; j++) {
            for (int i = n - 2; i >= 0; i--) {
                c[i][j] += c[i + 1][j];
                if (v[i + 1][j] == 'I') {
                    c[i][j]++;
                }
            }
        }
        long long int answer = 0;
        for (int j = 0; j < m; j++) {
            for (int i = 0; i < n; i++) {
                if (v[i][j] == 'J') {
                    answer += (r[i][j] * 1LL * c[i][j]);
                }
            }
        }
        cout << answer;
        cout << "\n";
    }
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    solve(false);
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50