Submission #947369

#	Time	Username	Problem	Language	Result	Execution time	Memory
947369		steveonalex	Bitaro the Brave (JOI19_ho_t1)	C++11	100 / 100	140 ms	89932 KiB

joi2019_ho_t1

#include <bits/stdc++.h>


 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 3009;
int sum1[N][N], sum2[N][N];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m; cin >> n >> m;
    vector<string> a(n);
    for(int i= 0; i<n; ++i) cin >> a[i];

    for(int i = 0; i<n; ++i)
    for(int j = 0; j<m; ++j){
        if (a[i][j] == 'O') sum1[i][j]++;
        if (a[i][j] == 'I') sum2[i][j]++;
    }

    for(int i= 0; i<n; ++i)
    for(int j = m-1; j>=0; --j) sum1[i][j] += sum1[i][j+1];

    for(int i = n-1; i>=0; --i)
    for(int j = 0; j<m; ++j) sum2[i][j] += sum2[i+1][j];

    ll ans=  0;
    for(int i = 0; i<n; ++i)
    for(int j = 0; j<m; ++j) if (a[i][j] == 'J'){
        ans += sum1[i][j] * sum2[i][j];
    }

    cout << ans << "\n";
 
    return 0;
}

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