제출 #574052

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

joi2019_ho_t1

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pb push_back
#define epb emplace_back
using namespace std;

int prefr[3001][3001], prefc[3001][3001];

int main(){
    int n, m; cin >> n >> m;
    char c[n + 1][m + 1];
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++) cin >> c[i][j];
    }
    for(int i = 1; i <= n; i++){
        prefr[i][0] = 0;
        for(int j = 1; j <= m; j++) {
            prefr[i][j] = prefr[i][j - 1];
            if(c[i][j] == 'O') prefr[i][j]++;
        }
    }
    for(int j = 1; j <= m; j++){
        prefc[0][j] = 0;
        for(int i = 1; i <= n; i++){
            prefc[i][j] = prefc[i - 1][j];
            if(c[i][j] == 'I') prefc[i][j]++;
        }
    }
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(c[i][j] == 'J'){
                ll x = prefr[i][m] - prefr[i][j];
                ll y = prefc[n][j] - prefc[i][j];
                ans += x  * y;
            }
        }
    }
    cout << ans;
}

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