Submission #940697

#	Time	Username	Problem	Language	Result	Execution time	Memory
940697		evenvalue	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	108 ms	89600 KiB

joi2019_ho_t1

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

#ifdef evenvalue
  #include "debug.h"
#else
  #define debug(...)
#endif

using int64 = long long;
using ld = long double;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

namespace Read {
int Int() {
  int x;
  cin >> x;
  return x;
}
int64 Int64() {
  int64 x;
  cin >> x;
  return x;
}
char Char() {
  char c;
  cin >> c;
  return c;
}
string String() {
  string s;
  cin >> s;
  return s;
}
double Double() {
  return stod(String());
}
ld LongDouble() {
  return stold(String());
}
template<typename T1, typename T2>
pair<T1, T2> Pair() {
  pair<T1, T2> p;
  cin >> p.first >> p.second;
  return p;
}
template<typename T>
vector<T> Vec(const int n) {
  vector<T> v(n);
  for (T &x : v) {
    cin >> x;
  }
  return v;
}
template<typename T>
vector<vector<T>> VecVec(const int n, const int m) {
  vector<vector<T>> v(n);
  for (vector<T> &vec : v) {
    vec = Vec<T>(m);
  }
  return v;
}
}//namespace Read

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;
constexpr int kMaxN = 2e5 + 10;

inline void solution() {
  const auto n = Read::Int();
  const auto m = Read::Int();
  const auto grid = Read::Vec<string>(n);

  vector<vector<int>> below(n, vector<int>(m));
  vector<vector<int>> right(n, vector<int>(m));

  for (int j = 0; j < m; j++) {
    below[n - 1][j] = (grid[n - 1][j] == 'I');
  }
  for (int i = 0; i < n; i++) {
    right[i][m - 1] = (grid[i][m - 1] == 'O');
  }

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

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

  int64 ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (grid[i][j] != 'J') continue;
      ans += right[i][j] * 1LL * below[i][j];
    }
  }

  cout << ans << '\n';
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  //freopen(".in", "r", stdin);
  //freopen(".out", "w", stdout);

  cout << fixed << setprecision(10);

  int testcases = 1;
  //cin >> testcases;
  while (testcases--) {
    solution();
  }
}

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