제출 #710754

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

joi2019_ho_t1

#include <bits/stdc++.h>

using namespace std;

int main () {
  int n, m; cin >> n >> m;
  vector<string> grid(n);
  for (int i = 0; i < n; i++) {
    cin >> grid[i];
  }
  
  int count = 0;
  vector<vector<int>> js(n, vector<int>(m, 0));
  for (int y = 0; y < n; y++) {
    count = 0;
    for (int x = m - 1; x >= 0; x--) {
      if (grid[y][x] == 'O') count++;
      if (grid[y][x] == 'J') js[y][x] = count;

    }
  }
  
  long long ans = 0;
  count = 0;
  for (int x = 0; x < m; x++) {
    count = 0;
    for (int y = n-1; y >= 0; y--) {
      if (grid[y][x] == 'I') count++;
      if (grid[y][x] == 'J') ans += js[y][x]*count;
    }
  }
  cout << ans << '\n';
}

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