Submission #1165274

#TimeUsernameProblemLanguageResultExecution timeMemory
1165274GoBananas69Bitaro the Brave (JOI19_ho_t1)C++20
100 / 100
61 ms10124 KiB
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
typedef long long ll;
using namespace std;

signed main() {
    cin.tie() -> sync_with_stdio(0);
    ll n, m; 
    cin >> n >> m;
    vector<string> s(n); 
    for (auto &i: s) cin >> i;

    vector<ll> O(n + 1);
    vector<ll> I(m + 1);
    ll ans = 0;

    for (ll i = n - 1; i >= 0; --i) {
        for (ll j = m - 1; j >= 0; --j) {
            if (s[i][j] == 'J') ans += O[i] * I[j];
            if (s[i][j] == 'O') O[i]++;
            if (s[i][j] == 'I') I[j]++;
        }
    }
    cout << ans;
}

/*



*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...