#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <set>
#include <bitset>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = tuple<int,int,int>;
#define endl '\n'
int main(){
int n;cin >> n;
int m;cin >> m;
vector<pii> Jcnt;
vector<int> sumI(m,0);
vector<int> sumO(n,0);
for(int i{};i < n;i++){
string str;cin >> str;
for(int j{};j < m;j++){
char c = str[j];
if(c == 'I') sumI[j]++;
else if(c == 'O') sumO[i]++;
else if(c == 'J') Jcnt.emplace_back(i,j);
}
}
int sum = 0;
for(auto [i,j]:Jcnt){
sum += sumO[i]*sumI[j];
}
cout << sum;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |