Submission #1045038

#	Time	Username	Problem	Language	Result	Execution time	Memory
1045038		shezitt	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	275 ms	88476 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;

#define int ll 
#define fore(a, b, c) for(int a=b; a<c; ++a)
#define vi vector<int>
#define pb push_back
#define ii pair<int,int>
#define F first 
#define S second 
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define dbg(x) cerr << #x << ": " << x << endl
#define raya cerr << "========================" << endl

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int H = 3003;

char g[H][H];
int Is[H][H];

int h, w;

signed main(){
    cin >> h >> w;
    fore(i, 0, h){
        fore(j, 0, w){
            cin >> g[i][j];
        }
    }
    
    // cuantos Is hay debajo de J
    fore(j, 0, w){
        for(int i=h-1; i>=0; --i){
            Is[i][j] = Is[i+1][j];
            Is[i][j] += (g[i][j] == 'I');
        }
    }

    int ans = 0;

    fore(i, 0, h){
        int sumaIs = 0;
        fore(j, 0, w){
            if(g[i][j] == 'J'){
                sumaIs += Is[i][j];
            }

            if(g[i][j] == 'O'){
                ans += sumaIs;
            }

        }
    }

    cout << ans << endl;

}   

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