제출 #170582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
170582		WLZ	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	282 ms	89764 KiB

joi2019_ho_t1

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

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w;
  cin >> h >> w;
  vector<string> grid(h);
  vector< vector<int> > cnt_o(h, vector<int>(w, 0)), cnt_i(h, vector<int>(w, 0)); 
  for (int i = 0; i < h; i++) {
    cin >> grid[i];
  }
  for (int i = h - 1; i >= 0; i--) {
    for (int j = w - 1; j >= 0; j--) {
      if (grid[i][j] == 'O') {
        cnt_o[i][j] = 1;
      }
      if (grid[i][j] == 'I') {
        cnt_i[i][j] = 1;
      }
      if (j < w - 1) {
        cnt_o[i][j] += cnt_o[i][j + 1];
      }
      if (i < h - 1) {
        cnt_i[i][j] += cnt_i[i + 1][j];
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < w; j++) {
      if (grid[i][j] == 'J') {
        ans += (long long) cnt_o[i][j] * (long long) cnt_i[i][j];
      }
    }
  }
  cout << ans << '\n';
  return 0; 
}

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