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>
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define st first
#define nd second
using namespace std;
const int N = 3e3 + 10;
int sumi[N][N], sumo[N][N];
char c[N][N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(NULL);
int n, m; cin >> n >> m;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cin >> c[i][j];
}
}
ll cnt = 0;
for (int i = n; i >= 1; --i) for (int j = m; j >= 1; --j) sumi[i][j] = sumi[i+1][j] + (c[i][j] == 'I');
for (int i = n; i >= 1; --i) for (int j = m; j >= 1; --j) sumo[i][j] = sumo[i][j+1] + (c[i][j] == 'O');
for (int i = n; i >= 1; --i) for (int j = m; j >= 1; --j) if (c[i][j]=='J') cnt += (sumi[i][j]*sumo[i][j]);
cout << cnt << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |