제출 #898223

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
898223		andrei_iorgulescu	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	454 ms	150448 KiB

joi2019_ho_t1

#include <bits/stdc++.h>

using namespace std;

#define int long long

int n,m;
char a[3005][3005];
int flin[3005][3005],fcol[3005][3005];

signed main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> a[i][j];
    for (int i = 1; i <= n; i++)
    {
        for (int j = m; j >= 1; j--)
        {
            flin[i][j] = flin[i][j + 1];
            if (a[i][j] == 'O')
                flin[i][j]++;
        }
    }
    for (int j = 1; j <= m; j++)
    {
        for (int i = n; i >= 1; i--)
        {
            fcol[i][j] = fcol[i + 1][j];
            if (a[i][j] == 'I')
                fcol[i][j]++;
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (a[i][j] == 'J')
                ans += flin[i][j] * fcol[i][j];
    cout << ans;
    return 0;
}

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