제출 #329933

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
329933		Sho10	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	519 ms	159340 KiB

joi2019_ho_t1

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod (10*10*10*10*10*10*10*10*10+7)
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,c[3005][3005],r[3005][3005];
char a[3005][3005];
int32_t main(){
CODE_START;
cin>>n>>m;
for(ll i=1;i<=n;i++)
{
    for(ll j=1;j<=m;j++)
    {
        cin>>a[i][j];
    }
}
for(ll i=1;i<=n;i++)
{
    for(ll j=1;j<=m;j++){
        c[i][j]=c[i][j-1];
        if(a[i][j]=='O'){
            c[i][j]++;
        }
    }
}
for(ll j=1;j<=m;j++)
{
    for(ll i=1;i<=n;i++)
    {
        r[i][j]=r[i-1][j];
        if(a[i][j]=='I'){
            r[i][j]++;
        }
    }
}
ll ans=0;
for(ll i=1;i<=n;i++)
{
    for(ll j=1;j<=m;j++)
    {
        if(a[i][j]=='J'){
            ans+=max(0ll,(c[i][m]-c[i][j-1])*(r[n][j]-r[i-1][j]));
        }
    }
}
cout<<ans<<endl;
}

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