제출 #1023551

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1023551		baotoan655	Bitaro’s Party (JOI18_bitaro)	C++14	0 / 100	1 ms	348 KiB

bitaro

#include <bits/stdc++.h>
#define file(name)  if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define REV(i, b, a) for(int i = (b); i >= (a); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define ll long long
#define fi first 
#define se second
#define int long long
using namespace std;
const int N = 3005;
int n, m;
int a[N][N];
int hang[N][N][3], cot[N][N][3];
void solve(int tc) {
    cin >> n >> m;
    char ch;
    FOR(i, 1, n) FOR(j, 1, m) {
        cin >> ch;
        switch (ch) {
            case 'J' :
                a[i][j] = 0;
                break;
            case 'O' :
                a[i][j] = 1;
                break;
            case 'I' :
                a[i][j] = 2;
                break;
            default :
                break;
        }
    }
    FOR(i, 1, n) {
        REV(j, m, 1) {
            FOR(k, 0, 2) hang[i][j][k] = hang[i][j + 1][k];
            hang[i][j][a[i][j]]++;
        }
    }
    FOR(j, 1, m) {
        REV(i, n, 1) {
            FOR(k, 0, 2) cot[j][i][k] = cot[j][i + 1][k];
            cot[j][i][a[i][j]]++;
        }
    }
    int ans = 0;
    FOR(i, 1, n) FOR(j, 1, m) {
        if(a[i][j] == 0) {
            ans += hang[i][j + 1][1] * cot[j][i + 1][2];
        }
    }
    cout << ans << '\n';
}
int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int tc = 1; 
    // cin >> tc;
    for(int i = 1; i <= tc; ++i) solve(tc);
    return (0);
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 86