제출 #231794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
231794		peijar	Bitaro the Brave (JOI19_ho_t1)	C++17	20 / 100	13 ms	8064 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;

#define SZ(v) ((int)(v).size())
using ll = long long;

const int MAXDIM = 3001;
char grid[MAXDIM][MAXDIM];
int suffix_row[MAXDIM][MAXDIM];
int suffix_col[MAXDIM][MAXDIM];

int main(void)
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	int nb_lig, nb_col;
	cin >> nb_lig >> nb_col;
	for (int lig(0); lig < nb_lig; ++lig)
		for (int col(0); col < nb_col; ++col)	
			cin >> grid[lig][col];

	for (int lig(nb_lig-1); lig >= 0; --lig)
		for (int col(nb_col-1); col >= 0; --col)
		{
			suffix_row[lig][col] = suffix_row[lig][col+1] + (grid[lig][col] == 'O');
			suffix_col[lig][col] = suffix_col[lig+1][col] + (grid[lig][col] == 'I');
		}
	int ans(0);
	for (int lig(0); lig < nb_lig; ++lig)
		for (int col(0); col < nb_col; ++col)
			if (grid[lig][col] == 'J')
				ans += suffix_row[lig][col] * suffix_col[lig][col];
	cout << ans << endl;
}

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