제출 #378877

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

joi2019_ho_t1

#include <bits/stdc++.h>
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
#define all(x) x.begin(), x.end()
using namespace std;

map<char, int> conversion = {{'I', 0}, {'J', 1}, {'O', 2}};

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

	int nLigs, nCols; cin >> nLigs >> nCols;
	int vals[nLigs][nCols];
	int bas[nLigs][nCols], droite[nLigs][nCols];

	for (int ilig  = 0; ilig < nLigs; ++ilig){
		for (int icol = 0; icol < nCols; ++icol){
			char cara; cin >> cara;
			vals[ilig][icol] = conversion[cara];
		}
	}

	for (int icol = 0; icol < nCols; ++icol){
		bas[nLigs - 1][icol] = (vals[nLigs - 1][icol] == 0);
		for (int ind = nLigs - 2; ind >= 0; --ind)
			bas[ind][icol] = bas[ind + 1][icol] + (vals[ind][icol] == 0);
	}

	for (int ilig = 0; ilig < nLigs; ++ilig){
		droite[ilig][nCols - 1] = (vals[ilig][nCols - 1] == 2);
		for (int ind = nCols - 2; ind >= 0; --ind)
			droite[ilig][ind] = droite[ilig][ind + 1] + (vals[ilig][ind] == 2);
	}

	int sum = 0;
	for (int x = 0; x < nLigs; ++x)
		for (int y = 0; y < nCols; ++y){
			if (vals[x][y] == 1)
				sum += droite[x][y] * bas[x][y];
		}
	cout << sum << endl;
	return 0;
}

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