제출 #881523

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

joi2019_ho_t1

#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,m;
    cin>>n>>m;
    char a[n+1][m+1];
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>a[i][j];
    //! (i,j)='j',(i,l)='o',(k,j)='i'
    int ans=0;
    int sufo[n+1][m+2];
    for(int i=0;i<=n;i++)for(int j=0;j<=m+1;j++)sufo[i][j]=0;
    for(int i=1;i<=n;i++){
        for(int j=m;j>=1;j--){
            sufo[i][j]=sufo[i][j+1];
            if(a[i][j]=='O')sufo[i][j]++;
        }
    }
    int sufi[n+2][m+1];
    for(int i=0;i<=n+1;i++)for(int j=0;j<=m;j++)sufi[i][j]=0;
    for(int i=1;i<=m;i++){
        for(int j=n;j>=1;j--){
            sufi[j][i]=sufi[j+1][i];
            if(a[j][i]=='I')sufi[j][i]++;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(a[i][j]=='J'){
                /*
                int r=0;
                for(int k=j+1;k<=m;k++)if(a[i][k]=='O')r++;
                int r1=0;
                for(int k=i+1;k<=n;k++)if(a[k][j]=='I')r1++;
                ans+=r*r1;*/
                ans+=sufo[i][j+1]*sufi[i+1][j];
            }
        }
    }
    cout<<ans;
}

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