oj.uz

답안 #1083750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1083750 2024-09-04T03:15:16 Z Flandre Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 487 ms 72388 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 0 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 1112 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 0 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 1112 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 5972 KB Output is correct
15 Correct 2 ms 3568 KB Output is correct
16 Correct 6 ms 3472 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 13 ms 6768 KB Output is correct
19 Correct 12 ms 6488 KB Output is correct
20 Correct 11 ms 6492 KB Output is correct
21 Correct 14 ms 6776 KB Output is correct
22 Correct 11 ms 6492 KB Output is correct
23 Correct 11 ms 6492 KB Output is correct
24 Correct 16 ms 6628 KB Output is correct
25 Correct 10 ms 6488 KB Output is correct
26 Correct 10 ms 6492 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 0 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 1112 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 5972 KB Output is correct
15 Correct 2 ms 3568 KB Output is correct
16 Correct 6 ms 3472 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 13 ms 6768 KB Output is correct
19 Correct 12 ms 6488 KB Output is correct
20 Correct 11 ms 6492 KB Output is correct
21 Correct 14 ms 6776 KB Output is correct
22 Correct 11 ms 6492 KB Output is correct
23 Correct 11 ms 6492 KB Output is correct
24 Correct 16 ms 6628 KB Output is correct
25 Correct 10 ms 6488 KB Output is correct
26 Correct 10 ms 6492 KB Output is correct
27 Correct 487 ms 72276 KB Output is correct
28 Correct 11 ms 18524 KB Output is correct
29 Correct 22 ms 6488 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 355 ms 60336 KB Output is correct
32 Correct 375 ms 72276 KB Output is correct
33 Correct 351 ms 72164 KB Output is correct
34 Correct 389 ms 69860 KB Output is correct
35 Correct 393 ms 72256 KB Output is correct
36 Correct 346 ms 72016 KB Output is correct
37 Correct 486 ms 72388 KB Output is correct
38 Correct 257 ms 60244 KB Output is correct
39 Correct 266 ms 60496 KB Output is correct