Submission #646850

#	Time	Username	Problem	Language	Result	Execution time	Memory
646850		tvladm2009	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	154 ms	70824 KiB

joi2019_ho_t1

#include <bits/stdc++.h>

using ll = long long;

int const nmax = 3000;

int a[1 + nmax][1 + nmax];
int ingots[1 + nmax][1 + nmax];

/*
1 -> jewel
2 -> orb
3 -> ingot
*/

int main() {
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(0);

  int n, m;
  std::cin >> n >> m;
  for(int i = 1;i <= n; i++) {
    std::string s;
    std::cin >> s;
    for(int j = 1;j <= m; j++) {
      if(s[j - 1] == 'J')
        a[i][j] = 1;
      else if(s[j - 1] == 'O')
        a[i][j] = 2;
      else
        a[i][j] = 3;
    }
  }
  for(int i = n;i >= 1; i--) {
    for(int j = 1;j <= m; j++) {
      ingots[i][j] = ingots[i + 1][j];
      if(a[i][j] == 3)
        ingots[i][j]++;
    }
  }
  
  ll ans = 0;
  for(int i = 1;i <= n; i++) {
    int orbs = 0;
    for(int j = m; j >= 1; j--) {
      if(a[i][j] == 1) {
        ans += orbs * ingots[i][j];
      } else if(a[i][j] == 2) {
        orbs++;
      }
    }
  }
  std::cout << ans;
  return 0;
}

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