Submission #234855

#	Time	Username	Problem	Language	Result	Execution time	Memory
234855		wiwiho	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	93 ms	12928 KiB

joi2019_ho_t1

//#define NDEBUG

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define pob pop_back()
#define pof pop_front()
#define F first
#define S second
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tiii tuple<int, int, int>
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) ((a) / (b) + !!((a) % (b)))

//#define TEST

typedef long long ll;
typedef unsigned long long ull;

using namespace std;
using namespace __gnu_pbds;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}


int main(){
    StarBurstStream

    int h, w;
    cin >> h >> w;

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

    vector<ll> cnt(w);
    ll ans = 0;
    for(int i = h - 1; i >= 0; i--){
        ll now = 0;
        for(int j = w - 1; j >= 0; j--){
            if(a[i][j] == 'O') now++;
            else if(a[i][j] == 'I') cnt[j]++;
            else ans += now * cnt[j];
        }
    }

    cout << ans << "\n";

    return 0;
}

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