답안 #464415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464415	2021-08-13T07:15:39 Z	MKutayBozkurt	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	13 ms	2756 KB

joi2019_ho_t1

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct item {
  int o, i;
};

int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int n, m; cin >> n >> m;
  vector<vector<char>> a(n + 1, vector<char>(m + 1));
  vector<vector<item>> cnt(n + 1, vector<item>(m + 1));
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> a[i][j];
      if (a[i][j] == 'O') cnt[i][j].o++;
      if (a[i][j] == 'I') cnt[i][j].i++;
      cnt[i][j].o += cnt[i][j - 1].o;
      cnt[i][j].i += cnt[i - 1][j].i;
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (a[i][j] == 'J') {
        ans += (cnt[i][m].o - cnt[i][j].o) * (cnt[n][j].i - cnt[i][j].i);
      }
    }
  }
  cout << ans << '\n';
}

Subtask #1

20.0 / 20.0

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

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	8 ms	2124 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	4 ms	1484 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	13 ms	2756 KB	Output is correct
19	Correct	8 ms	2708 KB	Output is correct
20	Incorrect	7 ms	2660 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	8 ms	2124 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	4 ms	1484 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	13 ms	2756 KB	Output is correct
19	Correct	8 ms	2708 KB	Output is correct
20	Incorrect	7 ms	2660 KB	Output isn't correct
21	Halted	0 ms	0 KB	-