제출 #1356387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1356387		gay	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	180 ms	150496 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#include <experimental/random>
#include <random>

//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;

using namespace std;

using ld = long double;
using ll = long long;

const ll INF = 3e18, MOD = 1e9 + 7;

void solve();

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    int q = 1;
    //cin >> q;
    while (q--) {
        solve();
    }
}

void solve() {
    int n, m; cin >> n >> m;
    vector<vector<char>> a(n, vector<char>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
        }
    }
    vector<vector<ll>> p1(n, vector<ll>(m)), p2(n, vector<ll>(m));
    for (int i = n - 1; i >= 0; i--) {
        for (int j = m - 1; j >= 0; j--) {
            if (a[i][j] == 'O') p1[i][j] = 1;
            if (j + 1 < m) p1[i][j] += p1[i][j + 1];
            if (a[i][j] == 'I') p2[i][j] = 1;
            if (i + 1 < n) p2[i][j] += p2[i + 1][j];
        }
    }
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (a[i][j] == 'J') {
                ans += p1[i][j] * p2[i][j];
            }
        }
    }
    cout << ans;
}

• 서브태스크 1: 20 / 20
• 서브태스크 2: 30 / 30
• 서브태스크 3: 50 / 50