Submission #702349

#	Time	Username	Problem	Language	Result	Execution time	Memory
702349		Koful123	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	225 ms	83736 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
 
void solve(){
 	
 	int n,m;
 	cin >> n >> m;

 	vector<string> s(n);
 	for(int i = 0; i < n; i++){
 		cin >> s[i];
 	}

 	vector<vector<int>> cnt(n,vector<int>(m));
 	for(int j = 0; j < m; j++){
 		for(int i = n - 1; i >= 0; i--){
 			cnt[i][j] = (i + 1 < n ? cnt[i + 1][j] : 0) + (s[i][j] == 'I');
 		}
 	}

 	int ans = 0;
 	for(int i = 0; i < n; i++){
 		int freq = 0;
 		for(int j = m - 1; j >= 0; j--){
 			freq += (s[i][j] == 'O');
 			if(s[i][j] == 'J'){
 				ans += freq * cnt[i][j];
 			}
 		}
 	}

 	cout << ans << endl;
}
 
signed main(){ 
 
	ios::sync_with_stdio(0);
	cin.tie(0);
 
	int t = 1;
//	cin >> t;
 
	while(t--)
		solve();
 	
	return 0;
}

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