제출 #916520

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
916520		viwlesxq	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	280 ms	159944 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
    return a > b && (a = b) == b;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
    return a < b && (a = b) == b;
}
const int inf = 1e9 + 7;
const int INF = 1e18 + 7;
const int mod = 1e9 + 7;

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m; cin >> n >> m;
    string s[n];
    for (int i = 0; i < n; ++i) cin >> s[i];
    int prefi[n][m], prefj[n][m];
    for (int i = 0; i < n; ++i) {
        prefi[i][0] = s[i][0] == 'O';
        for (int j = 1; j < m; ++j) {
            prefi[i][j] = prefi[i][j - 1] + (s[i][j] == 'O');
        }
    }
    for (int j = 0; j < m; ++j) {
        prefj[0][j] = s[0][j] == 'I';
        for (int i = 1; i < n; ++i) {
            prefj[i][j] = prefj[i - 1][j] + (s[i][j] == 'I');
        }
    }
    int res = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (s[i][j] == 'J')
                res += (prefi[i][m - 1] - prefi[i][j]) * (prefj[n - 1][j] - prefj[i][j]);
        }
    }
    cout << res;
} 

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