제출 #1262558

#제출 시각아이디문제언어결과실행 시간메모리
1262558sohamsen15Bitaro the Brave (JOI19_ho_t1)C++20
20 / 100
1093 ms580 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    ll h, w; cin >> h >> w;
    vector<vector<char>> a(h, vector<char>(w));

    for (ll i = 0; i < h; i++) {
        string s; cin >> s;
        for (ll j = 0; j < w; j++)
            a[i][j] = s[j];
    }

    // vector<ll> orbs(h);
    // for (ll i = 0; i < h; i++) {
    //     ll curr = 0;
    //     for (ll j = 0; j < w; j++)
    //         if (a[i][j] == 'O')
    //             curr++;
    //     orbs[i] = curr;
    // }

    // vector<ll> ingots(w);
    // for (ll j = 0; j < w; j++) {
    //     ll curr = 0;
    //     for (ll i = 0; i < h; i++)
    //         if (a[i][j] == 'I')
    //             curr++;
    //     ingots[j] = curr;
    // }

    // vector<vector<ll>> b(h, vector<ll>(w, 0));
    // for (ll i = 0; i < h; i++)
    //     for (ll j = 0; j < w; j++) 
    //         if (a[i][j] == 'J')
    //             b[i][j] = orbs[i] * ingots[j];

    // ll ans = 0;
    // for (ll i = 0; i < h; i++) 
    //     for (ll j = 0; j < w; j++)
    //         ans += b[i][j];

    ll ans = 0;
    for (ll i = 0; i < h; i++)
        for (ll j = 0; j < w; j++)
            for (ll k = 0; k < h; k++)
                for (ll l = 0; l < w; l++)
                    if (a[i][j] == 'J' && a[i][l] == 'O' && a[k][j] == 'I' && i < k && j < l)
                        ans++;

    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...