Submission #666924

#TimeUsernameProblemLanguageResultExecution timeMemory
666924divadBitaro the Brave (JOI19_ho_t1)C++14
20 / 100
20 ms8020 KiB
#include <iostream>
#define MAX 3002
using namespace std;
int n,m,ans;
char ch,v[MAX][MAX];
int o[MAX][MAX],ig[MAX][MAX];

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> ch;
            v[i][j] = ch;
        }
    }
    for(int i = n; i >= 1; i--){
        for(int j = 1; j <= m; j++){
            ig[i][j] = (v[i][j] == 'I')+ig[i+1][j];
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = m; j >= 1; j--){
            o[i][j] = (v[i][j] == 'O')+o[i][j+1];
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(v[i][j] == 'J'){
                ans += o[i][j]*ig[i][j];
            }
        }
    }
    cout << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...