Submission #529932

#TimeUsernameProblemLanguageResultExecution timeMemory
529932scottchouBitaro the Brave (JOI19_ho_t1)C++17
100 / 100
537 ms17920 KiB
#include<iostream>
using namespace std;
int const N = 3e3 + 5;
typedef long long LL;
char a[N][N];
LL icnt[N];
int main(){
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cin >> a[i][j];
        }
    }
    LL ans = 0;
    for(int i = n - 1; i >= 0; i--){
        LL ocnt = 0;
        for(int j = m - 1; j >= 0; j--){
            if(a[i][j] == 'J'){
                ans += icnt[j] * ocnt;
            }else if(a[i][j] == 'I'){
                icnt[j]++;
            }else{
                ocnt++;
            }
        }
    }
    cout << ans << '\n';

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...