oj.uz

Submission #601229

# Submission time Handle Problem Language Result Execution time Memory
601229 2022-07-21T13:26:09 Z jjiangly Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 6 ms 2900 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()
#define siz(x) int(x.size())
#define ll long long
#define ar array
#define vt vector
#define inf INT_MAX
#define lnf LLONG_MAX

const int nxm = int(3e3) + 7;

int h, w;
vt<string> a(nxm);

namespace sub1 {
  void solve() {
    vt<vt<int>> c(h, vt<int> (w, 0));
    vt<vt<int>> c2(h, vt<int> (w, 0));
    for (int i = 0; i < h; ++i) {
      for (int j = 0; j < w; ++j) {
        if (a[i][j] == 'I') {
          ++c[i][j];
        } else if (a[i][j] == 'O') {
          ++c2[i][j];
        }
      }
    }
    for (int i = 0; i < h; ++i) {
      for (int j = 0; j < w - 1; ++j) {
        c2[i][j + 1] += c2[i][j];
      }
    }
    for (int j = 0; j < w; ++j) {
      for (int i = 0; i < h - 1; ++i) {
        c[i + 1][j] += c[i][j];
      }
    }
    int ans = 0;
    for (int i = 0; i < h; ++i) {
      for (int j = 0; j < w; ++j) {
        if (a[i][j] == 'J') {
          ans += (c[h - 1][j] - c[i][j]) * (c2[i][w - 1] - c2[i][j]);
        }
      }
    }
    cout << ans << "\n";
  }
};

int subtask() {
//  if (h <= 100 && w <= 100) {
//    return 1;
//  } else if (h <= 500 && w <= 100) {
//    return 2;
//  }
  return 1;
}

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

  cin >> h >> w;
  for (int i = 0; i < h; ++i) {
    cin >> a[i];
  }
  if (subtask() == 1) {
    sub1::solve();
  }

  return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 5 ms 2132 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 1620 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 6 ms 2836 KB Output is correct
19 Correct 4 ms 2772 KB Output is correct
20 Incorrect 4 ms 2900 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 5 ms 2132 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 1620 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 6 ms 2836 KB Output is correct
19 Correct 4 ms 2772 KB Output is correct
20 Incorrect 4 ms 2900 KB Output isn't correct
21 Halted 0 ms 0 KB -