Submission #416600

#	Time	Username	Problem	Language	Result	Execution time	Memory
416600		ioi	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	412 ms	159748 KiB

joi2019_ho_t1

#include<bits/stdc++.h>
/*
Created By Tornado2004
*/
using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n

#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("ladder.in","r",stdin );
#define outF freopen("ladder.out" , "w" , stdout ) ;
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;

#define ll long long
#define int ll
#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
const int N = 2e5 + 3 , K = 11 , M = N * 4 ;
const ll MOD = 998244353 , oo = 1e9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;

//37
// (a ^ b / c ) % mod = (a ^ b ) % MOD * (c ^ (mod - 2)) % mod
// m is prime --> (a ^ m) % m = a % m

int di[] = {0 , 0 , 1 , -1};
int dj[] = {1 , -1 , 0 , 0};





int32_t main()
{   //inF;
    //inF;outF;
    fastio;




    int n , m ;
    cin >> n >> m ;
    ll ans = 0 ;

    char arr[n][m];

    for(int i = 0 ; i < n ; i ++)
        for(int j = 0 ; j < m ; j ++)
            cin >> arr[i][j];

    int cumi[n + 10][m + 10] = {} , cumo[n + 10][m + 10] = {};

    for(int j = 0 ;j < m ; j++){

        int sum = 0 ;
        for(int i = n - 1 ; i >= 0 ; i -- ){
            if(arr[i][j] == 'I')sum ++ ;
            cumi [i][j] = sum ;
        }
    }

    for(int i = 0 ; i < n ;i ++){

        int sum = 0 ;

        for(int j = m - 1 ; j >= 0 ; j --){
            if(arr[i][j] == 'O')sum ++ ;
            cumo[i][j] = sum ;
        }

    }
    for(int i = 0 ;i < n ; i ++){
        for(int j = 0 ;j < m ; j ++){
            if(arr[i][j] == 'J'){
                ans += 1ll * cumi[i][j] * cumo[i][j];

            }
        }
    }
    cout << ans ;


}

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