Submission #328665

#TimeUsernameProblemLanguageResultExecution timeMemory
328665a_playerBitaro the Brave (JOI19_ho_t1)C++14
0 / 100
1 ms492 KiB
#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[j].begin(),row[j].end(),i)-row[j].begin(); int q=lower_bound(col[i].begin(),col[i].end(),j)-col[i].begin(); sol+=(ll)(row[j].size()-p)*(ll)(col[i].size()-q); } } cout<<sol<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...