제출 #947616

#제출 시각아이디문제언어결과실행 시간메모리
947616packmaniBitaro the Brave (JOI19_ho_t1)C++14
100 / 100
353 ms161668 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int n,m;
string s[3005];
int suff_o[3005][3005];
int suff_i[3005][3005];
int sum;
int32_t main()
{
	cin >> n >> m;
	for(int i=0;i<n;i++)
		cin >> s[i];

	for(int i=0;i<n;i++)
	{
		for(int j=m-1;j>=0;j--)
		{
			suff_o[i][j]=suff_o[i][j+1];
			if(s[i][j]=='O') suff_o[i][j]++;
		}
	}
	for(int i=0;i<m;i++)
	{
		for(int j=n-1;j>=0;j--)
		{
			suff_i[j][i]=suff_i[j+1][i];
			if(s[j][i]=='I') suff_i[j][i]++;
		}
	}
	sum=0;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<m;j++)
		{
			if(s[i][j]=='J')
			{
				sum+=(suff_i[i][j])*(suff_o[i][j]);
			}
		}
	}
	cout << sum;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...