Submission #1274883

#	Time	Username	Problem	Language	Result	Execution time	Memory
1274883		KluydQ	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	112 ms	150920 KiB

joi2019_ho_t1

#include <bits/stdc++.h>

#define respagold ios_base::sync_with_stdio(0), cin.tie(0);     
#define int long long
#define ll long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define ppi pair <pair <int, int>, int>
#define pip pair <int, pair <int, int>>
#define mkp make_pair
 
using namespace std;
 
const int N = 3e3 + 12;
const int inf = 2e18;
const int mod = 1e9 + 7;
const double eps = 1e-20;

int n, m, x, y, k, pi[N][N], pj[N][N];
string s[N];

void solve()
{
	cin >> n >> m;
	
	FOR( i, 1, n, 1 )
	{
		cin >> s[i];
		s[i] = '=' + s[i];
	}
	FORR( i, n, 1, 1 )
	{
		FORR( j, m, 1, 1 )
		{
			pi[i][j] = pi[i][j + 1] + (s[i][j] == 'O');
			pj[i][j] = pj[i + 1][j] + (s[i][j] == 'I');
		}
	}
	int ans = 0;
	
	FOR( i, 1, n, 1 )
	{
		FOR( j, 1, m, 1 )
		{
			if( s[i][j] == 'J' ) ans += pi[i][j] * pj[i][j];
		}
	}
	cout << ans << '\n';
}
signed main()
{
	respagold
	
	int test = 1;
	if( !test ) cin >> test;
	while( test -- ) solve();
}

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