제출 #659148

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

joi2019_ho_t1

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

#define ll long long
#define endl '\n'

const ll MOD = 1e9+7;
const ll INF = 1e16;
const ll MAX = 2 * 1e5;

void solve(){
	int n,m;
	cin>>n>>m;
	char arr[n][m];
	vector<array<int,3>> cols(m), rows(n);
	for(int i = 0; i < n ;i++){
		for(int j = 0; j < m; j++){
			cin>>arr[i][j];

			if(arr[i][j] == 'J'){
				cols[j][0]++;
				rows[i][0]++;
			}else if(arr[i][j] == 'O'){
				cols[j][1]++;
				rows[i][1]++;
			}else{
				cols[j][2]++;
				rows[i][2]++;
			}
		}
	}

	ll ans = 0;

	for(int i = 0; i < n ;i++){
		for(int j = 0; j < m; j++){
			if(arr[i][j] == 'J'){
				cols[j][0]--;
				rows[i][0]--;

				ans+= rows[i][1] * cols[j][2];
			}else if(arr[i][j] == 'O'){
				cols[j][1]--;
				rows[i][1]--;
			}else{
				cols[j][2]--;
				rows[i][2]--;
			}
		}
	}

	cout<<ans;
}


int main()
{
	cin.tie(NULL);
	ios::sync_with_stdio(NULL);
	int t = 1;

	//cin >> t;

	while(t--){
		//cout<<"Case #"<<t<<" > "<<endl;
		solve();

		cout<<endl;
	}
}

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