제출 #626068

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

joi2019_ho_t1

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

int H, W;
vector<string> V;

void solve(){
	cin>>H>>W;
	V.assign(H, "");
	
	for(int i = 0; i < H; i++) cin>>V[i];
	
	long long ans = 0;
	
	vector<int> orbInRow(H, 0), ingotInCol(W, 0);
	
	for(int i = 0; i < H; i++)
		for(int j = 0; j < W; j++) orbInRow[i] += V[i][j] == 'O';
	
	for(int i = 0; i < W; i++)
		for(int j = 0; j < H; j++) ingotInCol[i] += V[j][i] == 'I';
	
	
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			if(V[i][j] == 'O') orbInRow[i]--;
			if(V[i][j] == 'I') ingotInCol[j]--;	
			if(V[i][j] != 'J') continue;
			// mi servono gli ingot sotto i
			ans += (long long)orbInRow[i] * (long long)ingotInCol[j];
			
			// cout<<"DEBUG-->"<<i+1<<" "<<j+1<<" "<<orbInRow[i] * ingotInCol[j]<<endl;
			
		}
	}
	
	cout<<ans<<endl;
}

int main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	
	solve();
	
	return 0;
}

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