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>
#define endl '\n'
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef long double ld;
const int N=3005;
char a[N][N];
int po[N][N],pi[N][N];
void solve()
{
int n,m;
cin >> n >> m;
for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin >> a[i][j];
ll ans=0;
for(int i=n;i>=1;i--) for(int j=m;j>=1;j--)
{
po[i][j]=po[i][j+1];
pi[i][j]=pi[i+1][j];
if(a[i][j]=='J') ans+=po[i][j]*pi[i][j];
else if(a[i][j]=='O') po[i][j]++;
else pi[i][j]++;
}
cout << ans << endl;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//freopen("hanhhhh.inp","r",stdin);
//freopen("hanhhhh.out","w",stdout);
int t=1;
//cin >> t;
while(t--) solve();
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... |