oj.uz

답안 #360139

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
360139 2021-01-27T14:21:44 Z Pety Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 300 ms 123912 KB 
#include <bits/stdc++.h>

using namespace std;

int n, m, dp[3002][3002][3], nr[3002][3];
char ch[] = "JOI";
char v[3002][3002];


int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      cin >> v[i][j];
  for (int i = n; i >= 1; i--)
    for (int j = 1; j <= m; j++)
      for (int k = 0; k < 3; k++)
        dp[i][j][k] = dp[i + 1][j][k] + (v[i][j] == ch[k]);
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = m; j >= 1; j--) {
      for (int k = 0; k < 3; k++)
        nr[j][k] = nr[j + 1][k] + (v[i][j] == ch[k]);
      if (v[i][j] == 'J')
        ans += 1ll * dp[i + 1][j][2] * nr[j + 1][1];
      //if (v[i][j] == 'O')
        //ans += 1ll * dp[i + 1][j][0] * nr[j + 1][2] + 1ll * dp[i + 1][j][2] * nr[j + 1][0];
      //if (v[i][j] == 'I')
        //ans += 1ll * dp[i + 1][j][1] * nr[j + 1][0] + 1ll * dp[i + 1][j][0] * nr[j + 1][1];
    }
  }
  cout << ans;
  return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 1 ms 1132 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 1 ms 1132 KB Output is correct
14 Correct 8 ms 6124 KB Output is correct
15 Correct 2 ms 3308 KB Output is correct
16 Correct 5 ms 3692 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 10 ms 6764 KB Output is correct
19 Correct 9 ms 6636 KB Output is correct
20 Correct 9 ms 6636 KB Output is correct
21 Correct 10 ms 7020 KB Output is correct
22 Correct 10 ms 6892 KB Output is correct
23 Correct 9 ms 6892 KB Output is correct
24 Correct 11 ms 7020 KB Output is correct
25 Correct 9 ms 6892 KB Output is correct
26 Correct 9 ms 6892 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 1 ms 1132 KB Output is correct
14 Correct 8 ms 6124 KB Output is correct
15 Correct 2 ms 3308 KB Output is correct
16 Correct 5 ms 3692 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 10 ms 6764 KB Output is correct
19 Correct 9 ms 6636 KB Output is correct
20 Correct 9 ms 6636 KB Output is correct
21 Correct 10 ms 7020 KB Output is correct
22 Correct 10 ms 6892 KB Output is correct
23 Correct 9 ms 6892 KB Output is correct
24 Correct 11 ms 7020 KB Output is correct
25 Correct 9 ms 6892 KB Output is correct
26 Correct 9 ms 6892 KB Output is correct
27 Correct 274 ms 123244 KB Output is correct
28 Correct 10 ms 16876 KB Output is correct
29 Correct 20 ms 10476 KB Output is correct
30 Correct 1 ms 748 KB Output is correct
31 Correct 203 ms 97388 KB Output is correct
32 Correct 278 ms 123756 KB Output is correct
33 Correct 252 ms 123544 KB Output is correct
34 Correct 268 ms 112876 KB Output is correct
35 Correct 265 ms 123756 KB Output is correct
36 Correct 257 ms 123580 KB Output is correct
37 Correct 300 ms 123912 KB Output is correct
38 Correct 181 ms 96748 KB Output is correct
39 Correct 181 ms 97004 KB Output is correct