Submission #97322

#	Time	Username	Problem	Language	Result	Execution time	Memory
97322		silxikys	Bitaro the Brave (JOI19_ho_t1)	C++14	50 / 100	1020 ms	79888 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 3005;
char grid[maxn][maxn];
int ocnt[maxn][maxn], icnt[maxn][maxn];
int H, W;

int main()
{
    cin >> H >> W;
    for (int i = 1; i <= H; i++) {
        for (int j = 1; j <= W; j++) {
            cin >> grid[i][j];
        }
    }
    for (int i = 1; i <= H; i++) {
        for (int j = W; j >= 1; j--) {
            ocnt[i][j] = ocnt[i][j+1];
            if (grid[i][j] == 'O') ocnt[i][j]++;
        }
    }
    for (int j = 1; j <= W; j++) {
        for (int i = H; i >= 1; i--) {
            icnt[i][j] = icnt[i+1][j];
            if (grid[i][j] == 'I') icnt[i][j]++;
        }
    }
    ll ans = 0;
    for (int i = 1; i <= H; i++) {
        for (int j = 1; j <= W; j++) {
            if (grid[i][j] != 'J') continue;
            ans += ocnt[i][j] * icnt[i][j];
        }
    }
    cout << ans << '\n';
}

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