Submission #494702

#	Time	Username	Problem	Language	Result	Execution time	Memory
494702		Haruto810198	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	478 ms	159268 KiB

joi2019_ho_t1

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = INT_MAX;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 3010;

int H, W;
char arr[MAX][MAX];
int so[MAX][MAX], si[MAX][MAX];
int res;

signed main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin>>H>>W;
	FOR(i, 1, H, 1){
		FOR(j, 1, W, 1){
			cin>>arr[i][j];
		}
	}

	FOR(i, 1, H, 1){
		for(int j=W; j>=1; j--){
			so[i][j] = so[i][j+1] + (arr[i][j] == 'O');
		}
	}

	FOR(j, 1, W, 1){
		for(int i=H; i>=1; i--){
			si[i][j] = si[i+1][j] + (arr[i][j] == 'I');
		}
	}

	FOR(i, 1, H, 1){
		FOR(j, 1, W, 1){
			if(arr[i][j] == 'J') res += so[i][j] * si[i][j];
		}
	}

	cout<<res<<'\n';
	
	return 0;

}

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