제출 #209874

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
209874		shart23	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	350 ms	151544 KiB

joi2019_ho_t1

#include <bits/stdc++.h>

#define int long long
#define endl '\n'
using namespace std;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<string> arr(n);
    for (auto &x : arr) {
        cin >> x;
    }
    vector<vector<int>> O(n, vector<int>(m)), I(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (arr[i][j] == 'O') {
                O[i][j]++;
            } else if (arr[i][j] == 'I') {
                I[i][j]++;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = m - 2; j >= 0; j--) {
            O[i][j] += O[i][j + 1];
        }
    }
    for (int j = 0; j < m; j++) {
        for (int i = n - 2; i >= 0; i--) {
            I[i][j] += I[i + 1][j];
        }
    }
    int res = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (arr[i][j] == 'J') {
                res += O[i][j] * I[i][j];
            }
        }
    }
    cout << res << endl;
}

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