제출 #553268

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

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second

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

int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

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