Submission #881509

#	Time	Username	Problem	Language	Result	Execution time	Memory
881509		_KuroNeko_	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	71 ms	19028 KiB

joi2019_ho_t1

#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
typedef long long ll;
typedef long double ldb;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vdb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
typedef set<int> si;
typedef set<long long> sl;
typedef set<double> sdb;
typedef set<string> ss;
typedef set<char> sc;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ftb(i, a, b) for (int i = a, _b = b; i <= _b; ++i)
#define ft(i, a, b) for (int i = a, _b = b; i < _b; ++i)
#define fgb(i, a, b) for (int i = a, _b = b; i >= _b; --i)
#define fg(i, a, b) for (int i = a, _b = b; i > _b; --i)
#define endl "\n"

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n, m;
    cin >> n >> m;
    vs a(n);
    ft(i, 0, n) {
        cin >> a[i];
    }
    vl numOrb(n, 0), numIng(m, 0);
    ll ans = 0;
    fgb(i, n - 1, 0) {
        fgb(j, m - 1, 0) {
            if (a[i][j] == 'O') numOrb[i] += 1;
            if (a[i][j] == 'I') numIng[j] += 1;
            if (a[i][j] == 'J') {
                ans += numOrb[i] * numIng[j];
            }
        }
    }
    cout << ans << endl;
}

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