제출 #818850

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

joi2019_ho_t1

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define endl "\n"
#define pii pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define pque priority_queue
#define pqueg priority_queue<ll,vector<ll>,greater<ll>>
#define que queue<ll>
#define FOR(m,i,n) for(int i=(m); i<=(n); i++)
#define FORM(m,i,n) for(int i=(m); i>=(n); i--)
#define all(v) sort(v.begin(),v.end())
ll h,w;
ll ans;
char grid[3030][3030];
ll prefi[3030][3030],prefo[3030][3030];
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> h >> w;
	FOR(1,i,h) {
		FOR(1,j,w) {
			cin >> grid[i][j];
			prefo[i][j] = prefo[i][j-1];
			prefi[i][j] = prefi[i-1][j];
			if(grid[i][j] == 'O') {
				prefo[i][j]++;
			}
			else if(grid[i][j] == 'I') {
				prefi[i][j]++;
			}
		}
	}
	FOR(1,i,h) {
		FOR(1,j,w) {
			if(grid[i][j] == 'J') {
				ans += (prefo[i][w] - prefo[i][j]) * (prefi[h][j] - prefi[i][j]);
			}
		}
	}
	cout << ans << endl;
}

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