제출 #389883

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

joi2019_ho_t1

#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;

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

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

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