제출 #716186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
716186		YeoBL	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	274 ms	158812 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
int32_t main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int n, k, ans = 0; cin >> n >> k;
	char ch[n][k];
	int cnt[n][k], cnt2[n][k];
	for (int i = 0; i < n; i++){
		for (int j = 0; j < k; j++){
			cin >> ch[i][j];
		}
	}
	for (int i = n - 1; i >= 0; i--){
		for (int j = k - 1; j >= 0; j--){
			if (i == n - 1) cnt[i][j] = 0;
			else cnt[i][j] = cnt[i + 1][j];
			if (j == k - 1) cnt2[i][j] = 0;
			else cnt2[i][j] = cnt2[i][j + 1];
			if (ch[i][j] == 'I') cnt[i][j]++;
			if (ch[i][j] == 'O') cnt2[i][j]++;
		}
	}
	for (int i = 0; i < n; i++){
		for (int j = 0; j < k; j++){
			if (ch[i][j] == 'J') ans += cnt[i][j] * cnt2[i][j];
		}
	}
	cout << ans;
}

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