Submission #1127797

#	Time	Username	Problem	Language	Result	Execution time	Memory
1127797		byhtlm	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	695 ms	150384 KiB

joi2019_ho_t1

  /***********************************
██╗░░██╗████████╗██╗░░░░░███╗░░░███╗
██║░░██║╚══██╔══╝██║░░░░░████╗░████║
███████║░░░██║░░░██║░░░░░██╔████╔██║
██╔══██║░░░██║░░░██║░░░░░██║╚██╔╝██║
██║░░██║░░░██║░░░███████╗██║░╚═╝░██║
╚═╝░░╚═╝░░░╚═╝░░░╚══════╝╚═╝░░░░░╚═╝
***********************************/

//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

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

//#include "functions.h"

#define int l
#define f first
#define s second
#define endl '\n'
#define l long long
#define ara <<" "<<
#define pb push_back
#define pairs pair<l,l>
#define NO cout<<"NO"<<endl
#define stop system("pause")
#define YES cout<<"YES"<<endl
#define all(v) v.begin(),v.end()
#define yesno(v) ((v) ? "YES" : "NO")
#define dbg(x) cout<<#x<<" = "<<x<<endl;
#define filereader() ifstream cin(input);
#define fileprinter() ofstream cout(output);
#define fast ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);


using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less_equal<int> , rb_tree_tag, tree_order_statistics_node_update> indexed_set;

const l N = 3e3 + 5;
const l INF = 1e18;
const l mod = 1e9 + 7;

const string  input =  "input.txt";
const string output = "output.txt";

l gcd(l a, l b){
    if(b == 0){
        return a;
    }
    return gcd(b,a%b);
}

l binpow(l a, l b) {
    if (b == 0)
        return 1;

    l res = binpow(a, b / 2);

    if (b % 2)
        return ((res * res) % mod * a) % mod;
    else
        return (res * res) % mod;
}


l pri[N][N];
l pro[N][N];
char c[N][N];





void solve(){
    l n,m;
    cin>>n>>m;

    for(int i = 1; i <= n ; i++){
        for(int j = 1; j <= m ; j++){
            cin>>c[i][j];
        }
    }


    for(int i = n ; i>=1; i--){
        for(int j = 1; j <= m ;j++){
            pri[i][j] = pri[i+1][j] + (c[i][j] == 'I');
        }
    }

    for(int i = 1 ; i <= n; i++){
        for(int j = m; j >= 1 ;j--){
            pro[i][j] = pro[i][j + 1] + (c[i][j] == 'O');
        }
    }


    l ans = 0;

    for(int i = 1; i <= n ; i++){
        for(int j = 1; j <= m ; j++){
            if(c[i][j] == 'J'){
                ans += pri[i][j] * pro[i][j];
            }
        }
    }

    cout<<ans<<endl;



}

signed main(){
    //fast;

    l n = 1;
    //cin>>n;

    while(n--){
        solve();
    }

}

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