제출 #1237243

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

joi2019_ho_t1

/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000007
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(time(0));
ll randll(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main(){
    speed;
    srand(time(0));

    ll n, m;
    cin >> n >> m;
    vstr s(n);
    for (int i = 0; i < n; i ++) {
        cin >> s[i];
    }

    vvll p(n+7, vll(m+7, 0)), p1(n+7, vll(m+7, 0));

    for (int i = n-1; i >= 0; i --) {
        for (int j = m-1; j >= 0; j --) {
            p1[i][j] = p1[i][j+1];
            p[i][j] = p[i+1][j];
            if (s[i][j] == 'I') p[i][j] ++;
            if (s[i][j] == 'O') p1[i][j] ++;
        }
    }

    ll res = 0;

    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < m; j ++) {
            if (s[i][j] == 'J') res += p[i+1][j]*p1[i][j+1];
        }
    }

    cout << res << endl;
}

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