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;
const int MAXN=3005;
char a[MAXN][MAXN];
int sufO[MAXN][MAXN],sufI[MAXN][MAXN];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,m;
cin >> n >> m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)cin >> a[i][j];
}
for(int i=1;i<=n;i++){
for(int j=m;j>=1;j--){
sufO[i][j]=sufO[i][j+1];
if(a[i][j]=='O')sufO[i][j]++;
}
}
for(int i=1;i<=m;i++){
for(int j=n;j>=1;j--){
sufI[i][j]=sufI[i][j+1];
if(a[j][i]=='I')sufI[i][j]++;
}
}
long long ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(a[i][j]=='J'){
ans+=(sufO[i][j+1]*sufI[j][i+1]);
}
}
}
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... |