제출 #994471

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
994471		Luvidi	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	117 ms	151068 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

void solve() {
    int n,m;
    cin>>n>>m;
    string a[n];
    for(int i=0;i<n;i++)cin>>a[i];
    ll ans=0,c1[n+1][m+1],c2[n+1][m+1];
    memset(c1,0,sizeof(c1));
    memset(c2,0,sizeof(c2));
    for(int i=n-1;i>-1;i--){
        for(int j=m-1;j>-1;j--){
            c1[i][j]=c1[i+1][j]+(a[i][j]=='I');
            c2[i][j]=c2[i][j+1]+(a[i][j]=='O');
            if(a[i][j]=='J')ans+=c1[i+1][j]*c2[i][j+1];
        }
    }
    cout<<ans;    
}

int main() {   
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
}

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