Submission #1237936

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237936		SG2Alok	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	260 ms	80088 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
#define endl '\n'
#define hitaf ios_base::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
 
template <typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag, tree_order_statistics_node_update>;
 
const ll MOD = 1e9 + 7;
const ll MOD1 = 998244353;
const ll INF = 4500000000000000000LL;
const ll INF1 = 1e18;
const ll mod1 = 6900000469;
const ll mod2 = 698000002369;
const int block = 160;

int n, m, k, q, a[1200005], b[500005], c[500005];
string s, s1, s2;

int main() {
    hitaf
	int T = 1;
//	cin >> T;
	
	while(T--){
		cin >> n >> m;
		
		vector<vector<char>> grid(n + 2, vector<char>(m + 2));
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				cin >> grid[i][j];
			}
		}
		
		vector<vector<ll>> sumR(n + 2, vector<ll>(m + 2));
		for(int i = 1; i <= n; i++){
			ll cnt = 0;
			for(int j = m; j >= 1; j--){
				if(grid[i][j] == 'O'){
					cnt++;
				} else if(grid[i][j] == 'J'){
					sumR[i][j] = cnt;
				}
			}
		}
		
		ll ans = 0;
		for(int j = 1; j <= m; j++){
			ll cnt = 0;
			for(int i = n; i >= 1; i--){
				if(grid[i][j] == 'I'){
					cnt++;
				} else if(grid[i][j] == 'J'){
					ans += cnt * sumR[i][j];
				}
			}
		}
		
		cout << ans << endl;
	}
}

/*


	8 3 4 2 1 5 7 6
	1 5 6 7 2 4 3 8

*/

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