This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#define int long long
using namespace std;
char a[3005][3005];
int ko[3005][3005];
int ki[3005][3005];
int32_t main()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n-1; i >= 0; i--)
for (int j = 0; j < m; j++)
ki[i][j] = ki[i+1][j]+(a[i][j] == 'I');
for (int j = m-1; j >= 0; j--)
for (int i = 0; i < n; i++)
ko[i][j] = ko[i][j+1]+(a[i][j] == 'O');
int rez = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (a[i][j] == 'J')
rez += ko[i][j]*ki[i][j];
cout << rez << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |