제출 #1163919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1163919		canhnam357	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	109 ms	10300 KiB

joi2019_ho_t1

// source problem : 
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define int long long
#define lb lower_bound
#define ub upper_bound
#define MASK(i) (1LL << (i))
const int inf = 1e18;
void ckmax(int& f, int s)
{
    f = (f > s ? f : s);
}
void ckmin(int& f, int s)
{
    f = (f < s ? f : s);
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<string> g(n);
    vector<int> r(n), c(m);
    for (int i = 0; i < n; i++)
    {
        cin >> g[i];
        for (int j = 0; j < m; j++)
        {
            if (g[i][j] == 'O') r[i]++;
            else if (g[i][j] == 'I') c[j]++;
        }
    }   
    int ans = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (g[i][j] == 'J') ans += r[i] * c[j];
            else if (g[i][j] == 'O') r[i]--;
            else c[j]--;
        }
    }
    cout << ans;
    return 0;
}

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