제출 #1122673

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

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
//#pragma GCC target("popcnt")
using namespace __gnu_pbds;
using namespace std;
using ordered_set = tree<int, null_type, less_equal<>, rb_tree_tag, tree_order_statistics_node_update>;
#define popcount __builtin_popcountll

string a[3000];
int row[3000], col[3000];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n,m; cin >> n >> m;
    for (int i = 0; i < n; cin >> a[i++]);
    long long ans = 0;
    for (int i = n-1; i >= 0; i--) {
        for (int j = m-1; j >= 0; j--) {
            if (a[i][j] == 'J')
                ans += row[i] * col[j];
            else if (a[i][j] == 'O')
                row[i]++;
            else
                col[j]++;
        }
    }
    cout << ans;
}

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