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 mx=3002;
typedef long long ll;
int inf=1e9+10;
const int mod=1e9+7;
int n,m;
int dp[mx][mx];
int dp2[mx][mx];
string s[mx];
int main(){
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>s[i];
}
for(int i=0;i<n;i++){
for(int j=m-1;j>=0;j--){
dp[i][j]=(s[i][j]=='O')+dp[i][j+1];
}
}
ll ans=0;
for(int i=n-1;i>=0;i--){
for(int j=m-1;j>=0;j--){
dp2[i][j]=(s[i][j]=='I')+dp2[i+1][j];
}
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(s[i][j]=='J'){
ans+=dp[i][j]*dp2[i][j];
}
}
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |