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 ll long long
#define pll pair<ll, ll>
#define fi first
#define se second
using namespace std;
const int N = 3005;
int n, m;
char a[N][N];
ll ans = 0, dem[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
cin >> a[i][j];
for(int i = n; i >= 1; i--)
{
ll cnt = 0;
for(int j = m; j >= 1; j--)
{
if(a[i][j] == 'I')
dem[j]++;
if(a[i][j] == 'O')
cnt++;
if(a[i][j] == 'J')
ans += cnt * dem[j];
}
}
cout << ans;
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... |