Submission #529787

#TimeUsernameProblemLanguageResultExecution timeMemory
529787HanksburgerBitaro the Brave (JOI19_ho_t1)C++17
100 / 100
160 ms88584 KiB
#include <bits/stdc++.h>
using namespace std;
int O[3005][3005], I[3005][3005];
char a[3005][3005];
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i=1; i<=n; i++)
		for (int j=1; j<=m; j++)
			cin >> a[i][j];
	long long ans=0;
	for (int i=n; i>=1; i--)
	{
		for (int j=m; j>=1; j--)
		{
			O[i][j]=O[i][j+1]+(a[i][j]=='O');
			I[i][j]=I[i+1][j]+(a[i][j]=='I');
			ans+=O[i][j]*I[i][j]*(a[i][j]=='J');
		}
	}
	cout << ans;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...