Submission #360138

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
360138	2021-01-27T14:21:20 Z	Pety	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	11 ms	7020 KB

joi2019_ho_t1

#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]);
  int 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

#	Verdict	Execution time	Memory	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

0 / 30.0

#	Verdict	Execution time	Memory	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	6400 KB	Output is correct
15	Correct	3 ms	3352 KB	Output is correct
16	Correct	5 ms	3820 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	11 ms	7020 KB	Output is correct
19	Correct	9 ms	6892 KB	Output is correct
20	Incorrect	9 ms	6892 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	Verdict	Execution time	Memory	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	6400 KB	Output is correct
15	Correct	3 ms	3352 KB	Output is correct
16	Correct	5 ms	3820 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	11 ms	7020 KB	Output is correct
19	Correct	9 ms	6892 KB	Output is correct
20	Incorrect	9 ms	6892 KB	Output isn't correct
21	Halted	0 ms	0 KB	-