제출 #1048191

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

joi2019_ho_t1

#include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef long double ld;

const int N=3005;

char a[N][N];
int po[N][N],pi[N][N];

void solve()
{
    int n,m;
    cin >> n >> m;
    for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin >> a[i][j];
    ll ans=0;
    for(int i=n;i>=1;i--) for(int j=m;j>=1;j--)
    {
        po[i][j]=po[i][j+1];
        pi[i][j]=pi[i+1][j];
        if(a[i][j]=='J') ans+=po[i][j]*pi[i][j];
        else if(a[i][j]=='O') po[i][j]++;
        else pi[i][j]++;
    }
    cout << ans << endl;
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //freopen("hanhhhh.inp","r",stdin);
    //freopen("hanhhhh.out","w",stdout);
    int t=1;
    //cin >> t;
    while(t--) solve();
    return 0;
}

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