Submission #1143950

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143950		monkey133	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	472 ms	150376 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll h,w, ans = 0;
char rc[3005][3005];
ll psc[3005][3005], psr[3005][3005];

int main()
{
	cin >> h >> w;
	for (ll i=0; i<h; ++i) for (ll j=0; j<w; ++j) cin >> rc[i][j];
	for (ll i=0; i<h; ++i) for (ll j=w-1; j>=0; --j) psc[i][j] = psc[i][j + 1] + (rc[i][j]=='O');
	for (ll j=0; j<w; ++j) for (ll i=h-1; i>=0; --i) psr[i][j] = psr[i + 1][j] + (rc[i][j]=='I');
	for (ll i=0; i<h; ++i) for (ll j=0; j<w; ++j) if (rc[i][j]=='J') ans += psr[i + 1][j]*psc[i][j + 1];
	cout << ans << endl;
	return 0;
}

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