제출 #377891

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

joi2019_ho_t1

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

#define int long long

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	int h,w;
	cin>>h>>w;
	char g[h+5][w+5];
	for(int i=1; i<=h; i++){
		for(int j=1; j<=w; j++){
			cin>>g[i][j];
		}
	}
	
	int so[h+5][w+5], si[h+5][w+5];
	memset(so,0,sizeof(so)); memset(si,0,sizeof(si));
	//Orb: sec is higher; Ingot: fst is higher
	
	for(int i=1; i<=h; i++){
		for(int j=w; j>=1; j--){
			so[i][j] = so[i][j+1];
			if(g[i][j]=='O') so[i][j]++;
		}
	}
	
	for(int i=h; i>=1; i--){
		for(int j=1; j<=w; j++){
			si[i][j]=si[i+1][j];
			if(g[i][j]=='I') si[i][j]++;
		}
	}
	int an=0;
	for(int i=1; i<=h; i++){
		for(int j=1; j<=w; j++){
			if(g[i][j]=='J') an += (so[i][j]*si[i][j]);
		}
	}
	cout<<an;
}

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