제출 #306739

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
306739		syy	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	400 ms	159096 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define INF (int) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss

ll h, w, ans, row[3005][3005], col[3005][3005];
char grid[3005][3005];

int main() {
	fastio; cin >> h >> w;
	FOR(i, 1, h) FOR(j, 1, w) cin >> grid[i][j];
	FOR(i, 1, h) DEC(j, w, 1) row[i][j] = row[i][j+1] + (grid[i][j] == 'O');
	FOR(i, 1, w) DEC(j, h, 1) col[i][j] = col[i][j+1] + (grid[j][i] == 'I');
	FOR(i, 1, h) FOR(j, 1, w) if (grid[i][j] == 'J') ans += row[i][j] * col[j][i];
	cout << ans;
}

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