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;
typedef long long int ll;
typedef pair<int,int> ii;
const int N = 3e3 + 5;
int n,m,orb[N],ing[N];
char a[N][N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n >> m;
for (int i = 1 ; i <= n ; i++)
for (int j = 1 ; j <= m ; j++) {
cin >> a[i][j];
if (a[i][j] == 'O')
orb[i]++;
if (a[i][j] == 'I')
ing[j]++;
}
ll ans = 0;
for (int i = 1 ; i <= n ; i++)
for (int j = 1 ; j <= m ; j++) {
if (a[i][j] == 'O')
orb[i]--;
if (a[i][j] == 'I')
ing[j]--;
if (a[i][j] == 'J')
ans += orb[i] * ing[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... |