제출 #1258701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1258701		quanaskinger	Bitaro the Brave (JOI19_ho_t1)	C++17	50 / 100	353 ms	339968 KiB

joi2019_ho_t1

#include<bits/stdc++.h>
using namespace std;
long long n, m, pre1[4][3005][3005], pre2[4][3005][3005];
char d[3] = {'J', 'I', 'O'};
int main() {
	cin >> m >> n;
	char arr[m + 5][n + 5];
	for (long long i = 1; i <= m; i++) {
		for (long long j = 1; j <= n; j++) {
			cin >> arr[i][j];
			for (long long k = 1; k <= 3; k++) {
				pre1[k][i][j] = pre1[k][i][j - 1] + (arr[i][j] == d[k - 1]);	
				pre2[k][i][j] = pre2[k][i - 1][j] + (arr[i][j] == d[k - 1]);	
			}
		}
	}
	long long res = 0;
	for (long long i = 1; i <= m; i++) {
		for (long long j = 1; j <= n; j++) {
			if (arr[i][j] == 'J') {
				res += (pre2[2][m][j] - pre2[2][i][j]) * (pre1[3][i][n] - pre1[3][i][j]);
			}
		}
	}
	cout << res;
}

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