제출 #99244

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

joi2019_ho_t1

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
typedef long long llong;

int h, w;
char grid[3000][3001];
int Ocnt[3001][3001];
int Icnt[3001][3001];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> h >> w;
    for (int i = 0; i < h; ++i) {
        cin >> grid[i];
    }
    for (int i = h; i--; ) {
        for (int j = w; j--; ) {
            Ocnt[i][j] = Ocnt[i][j + 1];
            Icnt[i][j] = Icnt[i + 1][j];
            if (grid[i][j] == 'O') ++Ocnt[i][j];
            if (grid[i][j] == 'I') ++Icnt[i][j];
        }
    }
    llong ans = 0;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            if (grid[i][j] == 'J') ans += Ocnt[i][j] * Icnt[i][j];
        }
    }
    printf("%lld\n", ans);
    return 0;
}

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