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 N 3005
#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second
ll T, n, a[N][N], b[N][N], m;
string s[N];
int main(){
ios::sync_with_stdio(false); cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> s[i];
s[i] = '#' + s[i];
}
for(int i = 1; i <= n; i++){
for(int j = m; j >= 1; j--){
a[i][j] = a[i][j+1];
if(s[i][j] == 'O') a[i][j]++;
}
}
for(int i = 1; i <= m; i++){
for(int j = n; j >= 1; j--){
b[j][i] = b[j+1][i];
if(s[j][i] == 'I') b[j][i]++;
}
}
ll ans = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
if(s[i][j] == 'J') ans += (b[i][j] * a[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... |