제출 #208413

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

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]){
	cin.tie(0), ios::sync_with_stdio(0);
	ll h, w;
	cin >> h >> w;
	char grid[h][w];
	for(ll i = 0; i < h; i++){
		for(ll k = 0; k < w; k++)
			cin >> grid[i][k];
	}
	ll ingot[h][w] = {0}, orb[h][w] = {0};
	for(ll i = 0; i < w; i++){
		ll counter = 0;
		for(ll k = h - 1; k >= 0; k--){
			if(grid[k][i] == 'I')
				counter++;
			ingot[k][i] = counter;
		}
	}
	for(ll i = 0; i < h; i++){
		ll counter = 0;
		for(ll k = w - 1; k >= 0; k--){
			if(grid[i][k] == 'O')
				counter++;
			orb[i][k] = counter;
		}
	}
	ll res = 0;
	for(ll i = 0; i < h; i++){
		for(ll k = 0; k < w; k++){
			if(grid[i][k] == 'J')
				res += orb[i][k] * ingot[i][k];
		}
	}
	cout << res;
	return 0;
}

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