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 finish(x) return cout << x << endl, 0
#define ll long long
const int N = 3001;
int n, m, g[N][N], h[N][N];
vector <string> a;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
a.resize(n);
for(auto &i : a) cin >> i;
for(int i = 0 ; i < n ; i++){
for(int j = m - 1 ; j >= 0 ; j--){
g[i][j] = g[i][j + 1] + (a[i][j] == 'O');
}
}
for(int j = 0 ; j < m ; j++){
for(int i = n - 1 ; i >= 0 ; i--){
h[i][j] = h[i + 1][j] + (a[i][j] == 'I');
}
}
ll ans = 0;
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < m ; j++){
if(a[i][j] == 'J'){
ans += 1LL * g[i][j] * h[i][j];
}
}
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |