제출 #1141106

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1141106		Shadow1	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	165 ms	151384 KiB

joi2019_ho_t1

// Programmer: Shadow1

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using str = string; // yay python!

#define i64 int64_t
#define show(x) cerr << (#x) << " = " << (x) << '\n';
#define output_vector(v) for(auto &x : v){cout << x << ' ';}cout << '\n';
#define output_pairvector(v) for(auto &x : v){cout << x.first << " " << x.second << '\n';}
#define read_vector(v) for(auto &x : v){cin >> x;}
#define vt vector
#define prq priority_queue
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define fir first
#define sec second
#define sz(x) ll(x.size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
// 
//

void solve() {
    int h, w;
    cin >> h >> w;
    vector<str> a(h);
    vector<vector<int>> O(h, vector<int>(w+1)), I(w, vector<int>(h+1));
    for(int i=0; i<h; ++i) {
        cin >> a[i];
    }
    for(int i=0; i<h; ++i) {
        for(int j=w-1; j>=0; --j) {
            O[i][j] = O[i][j+1] + (a[i][j] == 'O');
        }
    }
    for(int i=0; i<w; ++i) {
        for(int j=h-1; j>=0; --j)
            I[i][j] = I[i][j+1] + (a[j][i] == 'I'); 
    }
    int ans = 0;
    for(int i=0; i<h; ++i) {
        for(int j=0; j<w; ++j) {
            if(a[i][j] == 'J') {
                ans += O[i][j+1] * I[j][i+1];
            }
        }
    }
    cout << ans << '\n';
}



// CHECK YOUR OVERFLOWS!!!! 
signed main() {
    // freopen("output.txt", "w", stdout);
    // freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(NULL); 
    int T = 1;
    // cin >> T;
    for(int tc = 1; tc <= T; ++tc) {
        // cout << "Case #" << tc << ": ";
        solve();
    }

    return 0;
}

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