Submission #788441

#	Time	Username	Problem	Language	Result	Execution time	Memory
788441		mpawicka_77	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	461 ms	79852 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
const int N=3*1e3+2;
char T[N][N];
int H[N][N],W[N][N];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            cin>>T[i][j];
        }
    }
    for(int i=1;i<=n;i++)
    {
        int wyn=0;
        for(int j=m;j>=1;j--)
        {
            W[i][j]=wyn;
            if(T[i][j]=='O')wyn++;
        }
    }
    for(int j=1;j<=m;j++)
    {
        int wyn=0;
        for(int i=n;i>=1;i--)
        {
            H[i][j]=wyn;
            if(T[i][j]=='I')wyn++;
        }
    }
    long long wyn=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(T[i][j]=='J')
            {
                wyn+=H[i][j]*W[i][j];
            }
        }
    }
    cout<<wyn;
    return 0;
}

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