제출 #655065

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
655065		benjaminkleyn	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	135 ms	17832 KiB

joi2019_ho_t1

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int H, W;
char grid[3000][3000];
int ingots[3000] = {0};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> H >> W;
    for (int i = H - 1; i >= 0; i--)
        for (int j = W - 1; j >= 0; j--)
            cin >> grid[i][j];

    ll res = 0;
    for (int i = 1; i < H; i++)
    {
        int orbs = 0;
        for (int j = 1; j < W; j++)
        {
            orbs += (grid[i][j-1] == 'O');
            ingots[j] += (grid[i-1][j] == 'I');
            
            res += (grid[i][j] == 'J') * orbs * ingots[j];
        }
    }
    cout << res << '\n';

    return 0;
}

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