제출 #136792

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
136792		ekrem	Bitaro the Brave (JOI19_ho_t1)	C++98	100 / 100	463 ms	79864 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
 

#define mod 1000000007
#define mp make_pair
#define pb push_back
#define inside sl<=l&&r<=sr
#define outside sr<l||r<sl
using namespace std; 
typedef long long ll;
 
int n, m;
int dpo[3003][3003];
int dpi[3003][3003];
char mat[3003][3003];
 
int main(){
	//freopen("in", "r", stdin);
	//freopen("out", "w", stdout);
	cin.tie(0); ios::sync_with_stdio(false);
	
	cin >> n >> m;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			cin >> mat[i][j];
		}
	}
 
	for (int i = 0; i < n; i++){
		int sum = 0;
		for (int j = m-1; j >= 0; j--){
			sum += mat[i][j] == 'O';
			dpo[i][j] = sum;
		}
	}
 
	for (int j = 0; j < m; j++){
		int sum = 0;
		for (int i = n-1; i >= 0; i--){
			sum += mat[i][j] == 'I';
			dpi[i][j] = sum;
		}
	}

	ll ans = 0;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			if (mat[i][j] == 'J') ans += (ll)dpi[i][j]*(ll)dpo[i][j];
		}
	}
 
	cout << ans << endl;
 
}
//by ekrem

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