Submission #1131531

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131531		lopkus	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	330 ms	150336 KiB

joi2019_ho_t1

#include <bits/stdc++.h>

#define int long long

using namespace std;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    char a[n + 1][m + 1];
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    int sufo[n + 2][m + 2];
    int sufi[n + 2][m + 2];
    for(int i = 0; i <= n + 1; i++) {
        for(int j = 0; j <= m + 1; j++) {
            sufo[i][j] = 0;
            sufi[i][j] = 0;
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = m; j >= 1; j--) {
            sufo[i][j] = sufo[i][j + 1];
            if(a[i][j] == 'O') {
                sufo[i][j] += 1;
            }
        }
    }
    for(int i = 1; i <= m; i++) {
        for(int j = n; j >= 1; j--) {
            sufi[j][i] = sufi[j + 1][i];
            if(a[j][i] == 'I') {
                sufi[j][i] += 1;
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if(a[i][j] == 'J') {
                ans += sufo[i][j + 1] * sufi[i + 1][j];
            }
        }
    }
    cout << ans;
}

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