제출 #208461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
208461		AlainSu	Bitaro the Brave (JOI19_ho_t1)	C++14	0 / 100	6 ms	1656 KiB

joi2019_ho_t1

#include<bits/stdc++.h>
using namespace std;
const int MAXN=3003, MAXM=3003;
char s[3010][3010]={};
long long O[MAXN][MAXM]={},I[MAXN][MAXM]={},n,m;
double ans=0;
void input()
{
	cin>>n>>m;
	for (int i=1;i<=n;i++)
	    for (int j=1;j<=m;j++)
	         cin>>s[i][j];
}
void getO()
{
	for (int i=1;i<=n;i++)
	     for (int j=1;j<=m;j++)
	         {
	         	if (j!=1) {O[i][j]=O[i][j-1];};
	         	if (s[i][j]=='O') {O[i][j]++;}; 
			 }
}
void getI()
{
	for (int i=1;i<=n;i++)
	   for (int j=1;j<=m;j++)
	        {
	        	if (i!=1) {I[i][j]=I[i-1][j];};
	        	if (s[i][j]=='I') {I[i][j]++;};
			}
}
void process()
{
	for (int i=1;i<=n;i++)
	    for (int j=1;j<=m;j++)
	         if (s[i][j]=='J')
	         {
	         	ans+=(I[n][j]-I[i][j])*(O[i][m]-O[i][j]);
			 }
}
void output()
{
	cout<<ans;
}
int main()
{
	//freopen("C:/TEST/stoveout.txt","r",stdin);
	//freopen("C:/TEST/stoveoutout.txt","w",stdout);
    input();
    getO();
    getI();
    process();
    output();
    return 0;
} 

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