제출 #531972

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531972		abc864197532	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	159 ms	89608 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
	cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
	for (; l != r; ++l)
		cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif

int main () {
	owo;
	int n, m;
	cin >> n >> m;
	vector <string> s(n);
	vector <vector <int>> down(n, vector <int> (m, 0)), r(n, vector <int> (m, 0));
	for (int i = 0; i < n; ++i)
		cin >> s[i];
	for (int i = n - 1; ~i; --i) {
		for (int j = 0; j < m; ++j) {
			down[i][j] = (i + 1 < n ? down[i + 1][j] : 0) + (s[i][j] == 'I');
		}
	}
	for (int i = 0; i < n; ++i) {
		for (int j = m - 1; ~j; --j) {
			r[i][j] = (j + 1 < m ? r[i][j + 1] : 0) + (s[i][j] == 'O');
		}
	}
	lli ans = 0;
	for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) if (s[i][j] == 'J')
		ans += down[i][j] * r[i][j];
	cout << ans << endl;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50