제출 #865857

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

joi2019_ho_t1

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
// #pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 3000 + 5;
const int INF = 1e9;
const double eps = 1e-7;
string s[maxn];
int r[maxn][maxn], d[maxn][maxn];

int main(void){
	fastio;
	int h, w;
	cin>>h>>w;
	for(int i = 0; i < h; i++) cin>>s[i];
	for(int i = 0; i < h; i++){
		int cnt = 0;
		for(int j = w - 1; j >= 0; j--){
			if(s[i][j] == 'O') cnt++;
			if(s[i][j] == 'J') r[i][j] = cnt;
		}
	}
	for(int j = 0; j < w; j++){
		int cnt = 0;
		for(int i = h - 1; i >= 0; i--){
			if(s[i][j] == 'I') cnt++;
			if(s[i][j] == 'J') d[i][j] = cnt;
		}
	}
	ll ans = 0;
	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			if(s[i][j] == 'J') ans += r[i][j] * d[i][j];
		}
	}
	cout<<ans<<"\n";
}

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