제출 #119277

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119277		tutis	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	118 ms	87416 KiB

joi2019_ho_t1

/*input
4 4
JJOO
JJOO
IIJO
IIIJ
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int II[3030][3030];
int OO[3030][3030];
int main()
{
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	string s[n];
	for (int i = 0; i < n; i++)
		cin >> s[i];
	ll ans = 0;
	for (int i = n - 1; i >= 0; i--)
	{
		for (int j = m - 1; j >= 0; j--)
		{
			OO[i][j] = OO[i][j + 1];
			II[i][j] = II[i + 1][j];
			ll O = OO[i][j];
			ll I = II[i][j];
			if (s[i][j] == 'J')
				ans += O * I;
			OO[i][j] += (s[i][j] == 'O');
			II[i][j] += (s[i][j] == 'I');
		}
	}
	cout << ans << "\n";
}

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