제출 #465074

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
465074		Halit	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	772 ms	150340 KiB

joi2019_ho_t1

// author: Halit
#include <bits/stdc++.h>

int main() {
  int n, m;
  std::cin >> n >> m;

  std::vector<std::vector<char>> a(n, std::vector<char>(m));
  std::vector<std::vector<int64_t>> count_orbs(n+1, std::vector<int64_t>(m+1));
  std::vector<std::vector<int64_t>> count_ingots(n+1, std::vector<int64_t>(m+1));

  for (int i = 0;i < n; ++i) {
    for (int j = 0;j < m; ++j) {
      std::cin >> a[i][j];
      count_orbs[i][j] += (a[i][j] == 'O');
      count_ingots[i][j] += (a[i][j] == 'I');
    }
  }

  for (int i = 0;i < n; ++i) for (int j = m-1;j >= 0; --j) count_orbs[i][j] += count_orbs[i][j+1];
  for (int i = n-1;i >= 0; --i) for (int j = 0;j < m; ++j) count_ingots[i][j] += count_ingots[i+1][j];

  int64_t ans = 0;
  for (int i = 0;i < n; ++i) {
    for (int j = 0;j < m; ++j) {
      ans += (a[i][j] == 'J') * (count_orbs[i][j+1]) * (count_ingots[i+1][j]);
    }
  }

  std::cout << ans;
}

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