Submission #1036699

# Submission time Handle Problem Language Result Execution time Memory
1036699 2024-07-27T15:39:50 Z andrewp Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
143 ms 89532 KB
//Dedicated to my love, ivaziva
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
using ll = int64_t;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define dbg(x) cerr << #x << ": " << x << '\n';

int32_t main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	cerr.tie(nullptr);

	int n, m;
	cin >> n >> m;
	vector<string> a(n);
	for (int i = 0; i < n; i++) cin >> a[i];
	vector<vector<int> > ps1(n, vector<int>(m, 0)), ps2(n, vector<int>(m, 0));
	for (int i = 0; i < n; i++) {
		ps1[i][m - 1] = (a[i].back() == 'O');
		for (int j = m - 2; j >= 0; j--) {
			ps1[i][j] = ps1[i][j + 1] + (a[i][j] == 'O');
		}
	}
	for (int j = 0; j < m; j++) {
		ps2[0][j] = (a[0][j] == 'J' ? ps1[0][j] : 0);
		for (int i = 1; i < n; i++) {
			ps2[i][j] = ps2[i - 1][j] + (a[i][j] == 'J' ? ps1[i][j] : 0);
		}
	}
	ll ans = 0;
	for (int i = 1; i < n; i++) {
		for (int j = 0; j < m; j++) {
			ans += (a[i][j] == 'I' ? ps2[i - 1][j] : 0);
		}
	}
	cout << ans << '\n';
}
# 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
# 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 3 ms 2396 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 1 ms 1624 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 4 ms 2908 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 2 ms 2900 KB Output is correct
21 Correct 4 ms 2908 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 4 ms 2908 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2872 KB Output is correct
# 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 3 ms 2396 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 1 ms 1624 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 4 ms 2908 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 2 ms 2900 KB Output is correct
21 Correct 4 ms 2908 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 4 ms 2908 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2872 KB Output is correct
27 Correct 143 ms 84728 KB Output is correct
28 Correct 1 ms 856 KB Output is correct
29 Correct 5 ms 6660 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 105 ms 62264 KB Output is correct
32 Correct 106 ms 88940 KB Output is correct
33 Correct 116 ms 89428 KB Output is correct
34 Correct 116 ms 72276 KB Output is correct
35 Correct 113 ms 89028 KB Output is correct
36 Correct 109 ms 89424 KB Output is correct
37 Correct 142 ms 89532 KB Output is correct
38 Correct 70 ms 61772 KB Output is correct
39 Correct 70 ms 62340 KB Output is correct