Submission #535738

#	Time	Username	Problem	Language	Result	Execution time	Memory
535738		browntoad	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	373 ms	159096 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=3005;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================
char arr[maxn][maxn];
int corb[maxn][maxn];
int cing[maxn][maxn];
signed main (){
    IOS();
    int h, w; cin>>h>>w;
    REP(i,h){
        REP(j, w){
            cin>>arr[i][j];
        }
    }
    // corb is constant i
    REP(i, h){
        RREP(j, w){
            corb[i][j]=corb[i][j+1]+(arr[i][j]=='O');
        }
    }
    REP(j, w){
        RREP(i, h){
            cing[i][j]=cing[i+1][j]+(arr[i][j]=='I');
        }
    }
    int ans=0;
    REP(i, h){
        REP(j, w){
            if (arr[i][j]=='J'){
                ans+=corb[i][j]*cing[i][j];
            }
        }
    }
    cout<<ans<<endl;

}

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