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 ll;
const int nax=3e3+3;
char m[nax][nax];
vector<int> row[nax];
vector<int> col[nax];
int main(){
int h,w;
cin>>h>>w;
for(int i=0;i<h;i++)
for(int j=0;j<w;j++){
cin>>m[i][j];
if(m[i][j]=='O')row[i].push_back(j);
if(m[i][j]=='I')col[j].push_back(i);
}
ll sol=0;
for(int i=0;i<h;i++)
for(int j=0;j<w;j++){
if(m[i][j]=='J'){
int p=lower_bound(row[i].begin(),row[i].end(),j)-row[i].begin();
int q=lower_bound(col[j].begin(),col[j].end(),i)-col[j].begin();
sol+=(ll)(row[i].size()-p)*(ll)(col[j].size()-q);
}
}
cout<<sol<<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... |