제출 #928491

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

joi2019_ho_t1

#include <bits/stdc++.h>
 
#define ll long long
#define fi first
#define se second
#define ve vector
#define all(x) x.begin(), x.end()
 
using namespace std;
 
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
#pragma GCC optimize("O3")
 
signed main(){
    int n, m;
    cin >> n >> m;
    ve<string> v(n);
    for(auto& i : v)
        cin >> i;
    /* for(auto i : v) */
    /*     cout << i << endl; */
    ve<ve<int> > os(n, ve<int>(m, 0)), is(n, ve<int>(m, 0));
    for(int i = 0; i < n; i++){
        os[i][m - 1] = v[i][m - 1] == 'O';
        for(int j = m - 2; j >= 0; j--)
            os[i][j] = os[i][j + 1] + int(v[i][j] == 'O');
    }
    for(int j = 0; j < m; j++){
        is[n - 1][j] = v[n - 1][j] == 'I';
        for(int i = n - 2; i >= 0; i--)
            is[i][j] = is[i + 1][j] + int(v[i][j] == 'I');
    }
    ll res = 0;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            if(v[i][j] == 'J')
                res += os[i][j]*is[i][j];
    cout << res;
}

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