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;
long long n, m, d[3003][3003][3], fp;
char a;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
cin >> a;
if(a == 'J') d[i][j][0] = 1;
else if(a == 'O') d[i][j][1] = 1;
else d[i][j][2] = 1;
}
}
for(int i = n; i; --i) {
for(int j = m; j; --j) {
d[i][j][1] += d[i][j + 1][1];
d[i][j][2] += d[i + 1][j][2];
}
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(d[i][j][0]) {
fp += d[i][j][1] * d[i][j][2];
}
}
}
cout << fp << endl;
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... |