Submission #1023591

#TimeUsernameProblemLanguageResultExecution timeMemory
1023591vjudge1Bitaro the Brave (JOI19_ho_t1)C++17
100 / 100
141 ms18164 KiB
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define fi first
#define se second

using namespace std;

const int N = 3005;

int n, m;
char a[N][N];
ll ans = 0, dem[N];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            cin >> a[i][j];
    for(int i = n; i >= 1; i--)
    {
        ll cnt = 0;
        for(int j = m; j >= 1; j--)
        {
            if(a[i][j] == 'I')
                dem[j]++;
            if(a[i][j] == 'O')
                cnt++;
            if(a[i][j] == 'J')
                ans += cnt * dem[j];
        }
    }
    cout << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...