oj.uz

Submission #1083749

# Submission time Handle Problem Language Result Execution time Memory
1083749 2024-09-04T03:13:37 Z Flandre Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 489 ms 81236 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 12 ms 6236 KB Output is correct
15 Correct 2 ms 3676 KB Output is correct
16 Correct 5 ms 3420 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 15 ms 6952 KB Output is correct
19 Correct 11 ms 6748 KB Output is correct
20 Correct 9 ms 6748 KB Output is correct
21 Correct 15 ms 7000 KB Output is correct
22 Correct 11 ms 6744 KB Output is correct
23 Correct 14 ms 6748 KB Output is correct
24 Correct 14 ms 7004 KB Output is correct
25 Correct 10 ms 6748 KB Output is correct
26 Correct 10 ms 6716 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 12 ms 6236 KB Output is correct
15 Correct 2 ms 3676 KB Output is correct
16 Correct 5 ms 3420 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 15 ms 6952 KB Output is correct
19 Correct 11 ms 6748 KB Output is correct
20 Correct 9 ms 6748 KB Output is correct
21 Correct 15 ms 7000 KB Output is correct
22 Correct 11 ms 6744 KB Output is correct
23 Correct 14 ms 6748 KB Output is correct
24 Correct 14 ms 7004 KB Output is correct
25 Correct 10 ms 6748 KB Output is correct
26 Correct 10 ms 6716 KB Output is correct
27 Correct 471 ms 80724 KB Output is correct
28 Correct 9 ms 18648 KB Output is correct
29 Correct 23 ms 7252 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 395 ms 66488 KB Output is correct
32 Correct 381 ms 81152 KB Output is correct
33 Correct 345 ms 81024 KB Output is correct
34 Correct 409 ms 77140 KB Output is correct
35 Correct 388 ms 80996 KB Output is correct
36 Correct 367 ms 80836 KB Output is correct
37 Correct 489 ms 81236 KB Output is correct
38 Correct 274 ms 66296 KB Output is correct
39 Correct 272 ms 66136 KB Output is correct