제출 #888382

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

joi2019_ho_t1

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 3e3 + 7;
const ll oo = 1e18 + 69;

int n, m, col[maxn][maxn];
char a[maxn][maxn];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n>>m;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin>>a[i][j];
        }
    }

    for(int i = 1; i <= m; i++) {
        for(int j = n; j >= 1; j--) {
            col[i][j] = col[i][j + 1];
            if(a[j][i] == 'I') col[i][j]++;
        }
    }

    ll ans = 0;
    for(int i = 1; i <= n; i++) {
        ll sum = 0;
        for(int j = 1; j <= m; j++) {
            if(a[i][j] == 'J') sum += col[j][i + 1];
            if(a[i][j] == 'O') ans += sum;
        }
    }
    cout<<ans;
    return 0;
}

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