제출 #383994

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

joi2019_ho_t1

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

#define fi first
#define se second

typedef long long ll;
typedef pair<int,int> ii;

const int N = 3e3;
int n, m;
char a[N+2][N+2];
ll orb[N+2][N+2], ing[N+2][N+2];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
            orb[i][j] = orb[i][j-1] + (a[i][j] == 'O');
            ing[j][i] = ing[j][i-1] + (a[i][j] == 'I');
        }
    }
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (a[i][j] == 'J') {
                ans += (orb[i][m]-orb[i][j])*(ing[j][n]-ing[j][i]);
            }
        }
    }
    cout << ans << '\n';
    return 0;
}

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