Submission #623203

#	Time	Username	Problem	Language	Result	Execution time	Memory
623203		Abrar_Al_Samit	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	364 ms	159012 KiB

joi2019_ho_t1

#include<bits/stdc++.h>
using namespace std;

void PlayGround() {
  int n, m;
  cin>>n>>m;
  char c[n+2][m+2];
  for(int i=1; i<=n; ++i) {
    for(int j=1; j<=m; ++j) {
      cin>>c[i][j];
    }
  }  

  long long O[n+2][m+2];
  long long I[n+2][m+2];

  memset(O, 0, sizeof O);
  memset(I, 0, sizeof I);

  for(int i=1; i<=n; ++i) {
    for(int j=1; j<=m; ++j) {
      if(c[i][j]=='O') O[i][j] = 1;
      else if(c[i][j]=='I') I[i][j] = 1;
    }
  }

  for(int i=1; i<=n; ++i) {
    for(int j=m; j>0; --j) {
      O[i][j] += O[i][j+1];
    }
  }

  for(int j=1; j<=m; ++j) {
    for(int i=n; i>0; --i) {
      I[i][j] += I[i+1][j];
    }
  }

  long long ans = 0;
  for(int i=1; i<=n; ++i) {
    for(int j=1; j<=m; ++j) if(c[i][j]=='J') {
      ans += O[i][j+1] * I[i+1][j];
    }
  }
  cout<<ans<<'\n';

}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  PlayGround();
  return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50