제출 #747407

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

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
const int MxN = 3005;
int n , m , d[MxN][MxN] , r[MxN][MxN];
long long ans;
char grid[MxN][MxN];
int main()
{
    cin >> n >> m;
    for(int i=1 ; i<=n ; i++)for(int j=1 ; j<=m ; j++)cin >> grid[i][j];
    for(int i=n ; i>=1 ; i--)for(int j=1 ; j<=m ; j++)d[i][j] = d[i+1][j] + (grid[i][j]=='I');
    for(int i=1 ; i<=n ; i++)for(int j=m ; j>=1 ; j--)r[i][j] = r[i][j+1] + (grid[i][j]=='O');
    for(int i=1 ; i<=n ; i++)for(int j=1 ; j<=m ; j++)if(grid[i][j]=='J')ans+=d[i][j]*r[i][j];
    cout << ans;
    return 0;
}

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