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 <bits/stdc++.h>
using namespace std;
inline namespace
{
} // namespace
void solve()
{
int n, m;
cin >> n >> m;
vector<string> a(n);
for (string &s : a)
cin >> s;
vector suff1(n, vector<int>(m + 1, 0)), suff2(m, vector<int>(n + 1, 0));
for (int i = 0; i < n; i++)
{
for (int j = m - 1; j >= 0; j--)
suff1[i][j] = suff1[i][j + 1] + (a[i][j] == 'O');
}
for (int i = 0; i < m; i++)
{
for (int j = n - 1; j >= 0; j--)
suff2[i][j] = suff2[i][j + 1] + (a[j][i] == 'I');
}
int res = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (a[i][j] == 'J')
res += suff1[i][j] * suff2[j][i];
}
}
cout << res << '\n';
}
int main()
{
ios_base::sync_with_stdio(false), cin.tie(NULL);
solve();
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... |