제출 #698163

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

joi2019_ho_t1

#include <iostream>
using namespace std;

const int MAX_TAILLE = 4200;

int nbLigne, nbCol;
char grille[MAX_TAILLE][MAX_TAILLE];

int cumulO[MAX_TAILLE][MAX_TAILLE] = {0};
int cumulI[MAX_TAILLE][MAX_TAILLE] = {0};

void input() {
    cin >> nbLigne >> nbCol;

    for(int lig = 0; lig < nbLigne; lig++) {
        for(int col = 0; col < nbCol; col++) {
            cin >> grille[lig][col];
            cumulO[lig][col+1] = cumulO[lig][col];
            cumulI[lig+1][col] = cumulI[lig][col];

            if(grille[lig][col] == 'O') {
                cumulO[lig][col+1]++;
            }
            if(grille[lig][col] == 'I') {
                cumulI[lig+1][col]++;
            }
        }
    }
}

long long total = 0;

int main() {
    input();

    for(int lig = 0; lig < nbLigne; lig++) {
        for(int col = 0; col < nbCol; col++) {
            if(grille[lig][col] != 'J') continue;

            total += ((cumulO[lig][nbCol] - cumulO[lig][col]) * (cumulI[nbLigne][col] - cumulI[lig][col]));
        }
    }

    cout << total << endl;
}

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