제출 #713516

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

joi2019_ho_t1

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define st first
#define nd second
using namespace std;

const int N = 3e3 + 10;

int sumi[N][N], sumo[N][N];
char c[N][N];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int n, m; cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> c[i][j];
        }
    }
    ll cnt = 0;
    for (int i = n; i >= 1; --i) for (int j = m; j >= 1; --j) sumi[i][j] = sumi[i+1][j] + (c[i][j] == 'I');
    for (int i = n; i >= 1; --i) for (int j = m; j >= 1; --j) sumo[i][j] = sumo[i][j+1] + (c[i][j] == 'O');
    for (int i = n; i >= 1; --i) for (int j = m; j >= 1; --j) if (c[i][j]=='J') cnt += (sumi[i][j]*sumo[i][j]);
    cout << cnt << '\n';
}

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