Submission #1088834

#	Time	Username	Problem	Language	Result	Execution time	Memory
1088834		LucasLe	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	174 ms	88916 KiB

joi2019_ho_t1

#include <bits/stdc++.h>


#define                int  long long
#define              moony  long long
#define                pii  pair<int, int>
#define                 fi  first
#define                 se  second
#define                 ld  long double
#define                 vi  vector<int>
#define                vii  vector<vector<int>>
#define             all(v)  (v).begin(), (v).end()
#define       rep(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i)
#define       per(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i)

using namespace std;

const int MOD = 1e9 + 7;

int add(int a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
  return a;
}

int mul(int a, int b) {
  (a *= b) %= MOD;
  return a;
}

int ceil(int x, int y) {
  return (x + y - 1) / y;
}

int bin_pow(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = res * x % MOD;
    x = x * x % MOD;
    y >>= 1;
  }
  return res;
}

template<class T> bool minimize(T& a, T b) {
  if (a > b) return a = b, true;
  return false;
}

template<class T> bool maximize(T& a, T b) {
  if (a < b) return a = b, true;
  return false;
}

const int INF = 1e17;
const int maxn = 3e3 + 5;

int n, m, ans;
int a[maxn + 5][maxn + 5];
string s[maxn + 5];

void solve(int tc) {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    cin >> s[i];
    s[i] = " " + s[i];
    for (int j = m, cnt = 0; j >= 1; --j) {
      if (s[i][j] == 'O') cnt++;
      if (s[i][j] == 'J')
        a[i][j] = cnt;
    }
  }
  for (int j = 1; j <= m; ++j) {
    for (int i = n, cnt = 0; i >= 1; --i) {
      if (s[i][j] == 'I') cnt++;
      if (s[i][j] == 'J')
        ans += a[i][j] * cnt;
    }
  }
  cout << ans;
}

signed main() {

  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);

  int tc = 1;
  //cin >> tc;

  for (int i = 1; i <= tc; ++i) {
    solve(i);
  }
}

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