Submission #137403

#	Time	Username	Problem	Language	Result	Execution time	Memory
137403		MladenP	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	490 ms	168312 KiB

joi2019_ho_t1

#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 3010
lld rez, O[MAXN][MAXN], I[MAXN][MAXN];
string s[MAXN];
int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0);
    int H, W; cin >> H >> W;
    for(int i = 1; i <= H; i++) {
        cin >> s[i];
        s[i] = '#' + s[i] + '#';
    }
    for(int i = 1; i <= H; i++) {
        for(int j = W; j >= 1; j--) {
            O[i][j] = O[i][j+1] + (s[i][j] == 'O');
        }
    }
    for(int j = 1; j <= W; j++) {
        for(int i = H; i >= 1; i--) {
            I[i][j] = I[i+1][j] + (s[i][j] == 'I');
        }
    }
    for(int i = 1; i <= H; i++) {
        for(int j = 1; j <= W; j++) {
            if(s[i][j] == 'J') {
                rez += O[i][j]*I[i][j];
            }
        }
    }
    cout << rez;
}

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