Submission #167351

#TimeUsernameProblemLanguageResultExecution timeMemory
167351theStaticMindBitaro the Brave (JOI19_ho_t1)C++14
100 / 100
485 ms154360 KiB
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

int32_t main(){
      ios_base::sync_with_stdio(false);
      cin.tie(NULL);
   //   freopen("q.gir","r",stdin);
   //   freopen("q.cik","w",stdout);
      int n,m,ans=0;
      cin>>n>>m;
      vector<string>s(n);
      vector<vector<int>>O(n,vector<int>(m+1,0)),I(n+1,vector<int>(m,0));
      for(int i=0;i<n;i++){
            cin>>s[i];
      }
      for(int i=0;i<n;i++){
            for(int j=m-1;j>=0;j--){
                  O[i][j]=O[i][j+1]+(s[i][j]=='O'?1:0);
            }
      }
      for(int j=0;j<m;j++){
            for(int i=n-1;i>=0;i--){
                  I[i][j]=I[i+1][j]+(s[i][j]=='I'?1:0);
            }
      }
      for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                  if(s[i][j]=='J'){
                        ans+=O[i][j]*I[i][j];
                  }
            }
      }
      cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...