Submission #761860

#	Time	Username	Problem	Language	Result	Execution time	Memory
761860		sysia	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	353 ms	159440 KiB

joi2019_ho_t1

//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

void solve(){
    int n, m; cin >> n >> m;
    vector<vector<char>>a(n+1, vector<char>(m+1));
    for (int i = 1; i<=n; i++){
        for (int j = 1; j<=m; j++) {
            cin >> a[i][j];
        }
    }
    vector O(n+1, vector<int>(m+1));
    vector I(n+1, vector<int>(m+1));
    for (int i = 1; i<=n; i++){
        for (int j = m; j>=1; j--){
            if (j + 1 <= m) O[i][j] += O[i][j+1];
            if (a[i][j] == 'O') O[i][j]++;
        }
    }
    for (int j = 1; j<=m; j++){
        for (int i = n; i>=1; i--){
            if (i+1 <= n) I[i][j] += I[i+1][j];
            if (a[i][j] == 'I') I[i][j]++;
        }
    }
    int ans = 0;
    for (int i = 1; i<=n; i++){
        for (int j = 1; j<=m; j++){
            if (a[i][j] == 'J'){
                ans += O[i][j] * I[i][j];
            }
        }
    }
    cout << ans << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

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