Submission #1355472

#TimeUsernameProblemLanguageResultExecution timeMemory
1355472magdakukavaBitaro the Brave (JOI19_ho_t1)C++20
100 / 100
384 ms150344 KiB
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=3005;
ll o[N][N],t[N][N],ans,n,m;
char a[N][N];

int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>a[i][j];
	
for(int i=1;i<=n;i++)
for(int j=m;j>=1;j--)
{ o[i][j]=o[i][j+1];
if(a[i][j]=='O') o[i][j]++;}
	
for(int j=1;j<=m;j++)
for(int i=n;i>=1;i--)
{t[i][j]=t[i+1][j];
if(a[i][j]=='I') t[i][j]++;}

for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(a[i][j]=='J')
ans+=o[i][j+1]*t[i+1][j];
	cout<<ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...