oj.uz

Submission #819091

# Submission time Handle Problem Language Result Execution time Memory
819091 2023-08-10T07:58:56 Z vjudge1 Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 574 ms 73288 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int NMAX = 3069;

int vals[NMAX][NMAX];
int oscores[NMAX][NMAX];
bool iexist[NMAX];
bool jexist[NMAX];

int main() {
  int I, J;
  cin >> I >> J;

  for (int i = 1; i <= I; i++) {
    for (int j = 1; j <= J; j++) {
      char v;
      cin >> v;
      
      if (v == 'J') {
        vals[i][j] = 1;
        iexist[i] = true;
        jexist[j] = true;
      } else if (v == 'I') {
        vals[i][j] = 2;
      } else {
        vals[i][j] = 3;
      }
    }
  }

  for (int i = I - 1; i > 0; i--) {
    if (!iexist[i]) continue;
    ll oscore = 0;
    for (int j = J; j > 0; j--) {
      if (vals[i][j] == 3) {
        oscore++;
      }
      oscores[i][j] = oscore;
    } 
  }


  // for (int i = 1; i <= I; i++) {
  //   for (int j = 1; j <= J; j++) {
  //     cout << oscores[i][j];
  //   }
  //   cout << endl;
  // }

  ll possibilities = 0;

  for (int j = J - 1; j > 0; j--) {
    if (!jexist[j]) continue;
    ll iscore = 0;
    for (int i = I; i > 0; i--) {
      if (vals[i][j] == 2) {
        iscore++;
      }
      if (vals[i][j] == 1) {
        possibilities += iscore * oscores[i][j];
      }
    } 
  }

  cout << possibilities << endl;

  return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1080 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 0 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 980 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1080 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 0 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 12 ms 6184 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 10 ms 3404 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 16 ms 6872 KB Output is correct
19 Correct 12 ms 6612 KB Output is correct
20 Correct 11 ms 6740 KB Output is correct
21 Correct 18 ms 6792 KB Output is correct
22 Correct 14 ms 6724 KB Output is correct
23 Correct 11 ms 6776 KB Output is correct
24 Correct 18 ms 6792 KB Output is correct
25 Correct 13 ms 6656 KB Output is correct
26 Correct 12 ms 6708 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1080 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 0 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 12 ms 6184 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 10 ms 3404 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 16 ms 6872 KB Output is correct
19 Correct 12 ms 6612 KB Output is correct
20 Correct 11 ms 6740 KB Output is correct
21 Correct 18 ms 6792 KB Output is correct
22 Correct 14 ms 6724 KB Output is correct
23 Correct 11 ms 6776 KB Output is correct
24 Correct 18 ms 6792 KB Output is correct
25 Correct 13 ms 6656 KB Output is correct
26 Correct 12 ms 6708 KB Output is correct
27 Correct 537 ms 73288 KB Output is correct
28 Correct 7 ms 18516 KB Output is correct
29 Correct 38 ms 7044 KB Output is correct
30 Correct 3 ms 572 KB Output is correct
31 Correct 406 ms 61168 KB Output is correct
32 Correct 442 ms 73052 KB Output is correct
33 Correct 414 ms 72892 KB Output is correct
34 Correct 462 ms 70848 KB Output is correct
35 Correct 465 ms 73112 KB Output is correct
36 Correct 457 ms 72828 KB Output is correct
37 Correct 574 ms 73056 KB Output is correct
38 Correct 298 ms 61056 KB Output is correct
39 Correct 283 ms 60996 KB Output is correct