제출 #844648

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
844648		leanchec	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	270 ms	89348 KiB

joi2019_ho_t1

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

int main(){
    int h, w;
    vector<string> grid;
    cin >> h >> w;

    for(int i=0; i<h; i++){
        string a;
        cin >> a;
        grid.push_back(a);
    }

    int sumO[3010][3010]={}, sumI[3010][3010]={};

    for(int i=h-1; i>=0; i--){
        for(int j=w-1; j>=0; j--){
            sumO[i][j]=sumO[i][j+1];
            if(grid[i][j]=='O')sumO[i][j]++;
            sumI[i][j]=sumI[i+1][j];
            if(grid[i][j]=='I')sumI[i][j]++;
        }
    }

    long long resp=0;

    for(int i=0; i<h; i++){
        for(int j=0; j<w; j++){
            if(grid[i][j]!='J')continue;
            resp+=(long long)sumO[i][j]*sumI[i][j];
        }
    }

    cout << resp << endl;
}

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