제출 #130616

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

joi2019_ho_t1

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ld, ld> pdd;
 
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = 3005;

int O[N][N];
int I[N][N];

bool is[N][N];

int main(){
    fastIO;
    int n, m;
    cin >> n >> m;
    char f;
    for(int i = 1; i <= n; i ++ ){
        for(int j = 1; j <= m ; j ++ ){
            cin >> f;
            if(f == 'J')
                is[i][j] = true;
            else if(f == 'O')
                O[i][j] = 1;
            else
                I[i][j] = 1;
        }
    }
    for(int i = 1; i <= n; i ++ ){
        for(int j = 1; j <= m ; j ++ ){
            O[i][j] += O[i][j-1];
            I[i][j] += I[i-1][j];
        }
    }
    ll res = 0;
    for(int i = 1; i <= n; i ++ ){
        for(int j = 1; j <= m; j ++ ){
            res += is[i][j] * (O[i][m] - O[i][j]) * (I[n][j] - I[i][j]);
        }
    }
    cout << res;
    return 0;
}

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