Submission #136210

#	Time	Username	Problem	Language	Result	Execution time	Memory
136210		Utaha	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	354 ms	89464 KiB

joi2019_ho_t1

/*input
4 4
JJOO
JJOO
IIJO
IIIJ
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define pb emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<'('<<P.F<<','<<P.S<<')';
    return out;
}
#define version 20190713
//}}}
const ll maxn=3005;
const ll maxlg=__lg(maxn)+2;
const ll INF64=8000000000000000000LL;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
//const ll p=880301;
//const ll P=31;

ll mypow(ll a,ll b){
    ll res=1LL;
    while(b){
        if(b&1) res=res*a%MOD;
        a=a*a%MOD;
        
        b>>=1;
    }
    return res;
}

string s[maxn];

int r[maxn][maxn];
int c[maxn][maxn];

int main(){
    IOS;
    int n,m;
    cin>>n>>m;
    REP(i,n) cin>>s[i];

    for(int j=m-1;j>=0;j--) REP(i,n){
        if(j==m-1) r[i][j]=(s[i][j]=='O');
        else r[i][j]=r[i][j+1]+(s[i][j]=='O');
    }
    for(int i=n-1;i>=0;i--) REP(j,m){
        if(i==n-1) c[i][j]=(s[i][j]=='I');
        else c[i][j]=c[i+1][j]+(s[i][j]=='I');
    }
    ll ans=0;
    REP(i,n) REP(j,m) if(s[i][j]=='J'){
        ans+=r[i][j]*c[i][j];
    }
    cout<<ans<<'\n';
    return 0;
}

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