제출 #710714

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
710714		mdub	Bitaro the Brave (JOI19_ho_t1)	C++14	0 / 100	1 ms	304 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];
  }
  vector<int> occsCols(m, 0);
  vector<int> occsLins(n, 0);
  for (int y = 0; y < n; y++) {
    for (int x = 0; x < m; x++) {
      if (grid[y][x] == 'O') occsLins[y]++;

    }
  }
  for (int x = 0; x < m; x++) {
    for (int y = 0; y < n; y++) {
      if (grid[y][x] == 'I') occsCols[x]++;
    }
  }
  long long ans = 0;
  for (int y = 0; y < n; y++) {
    for (int x = 0; x < m; x++) {
      if (grid[y][x] == 'J') {
	ans += occsCols[x] * occsLins[y];
      }
    }
  }cout << ans << '\n';
}

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