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;
 
#define int long long 
 
const int N = 3e3 + 5;
int n, m, arr[N][N], row[N][5], col[N][5];
 
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			char ch;
			cin >> ch;
			if (ch == 'J') arr[i][j] = 0;
			else if (ch == 'O') arr[i][j] = 1;
			else arr[i][j] = 2;
		}
	}
	int ans = 0;
	for (int i = n; i >= 1; i--) {
		for (int j = m; j >= 1; j--) {
			if (!arr[i][j]) ans += row[i][1]*col[j][2];
			row[i][arr[i][j]]++;
			col[j][arr[i][j]]++;
		}
	}
	cout << ans << '\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... |