Submission #868512

#TimeUsernameProblemLanguageResultExecution timeMemory
868512amirhoseinfar1385Bitaro the Brave (JOI19_ho_t1)C++17
100 / 100
230 ms88760 KiB
#include<bits/stdc++.h>
using namespace std;
const int maxn=3000+10;
char all[maxn][maxn];
int dp1[maxn][maxn],dp2[maxn][maxn];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,m;
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cin>>all[i][j];
		}
	}
	for(int j=0;j<m;j++){
		for(int i=n-1;i>=0;i--){
			dp1[i][j]+=dp1[i+1][j];
			if(all[i+1][j]=='I'){
				dp1[i][j]++;
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=m-1;j>=0;j--){
			dp2[i][j]+=dp2[i][j+1];
			if(all[i][j+1]=='O'){
				dp2[i][j]++;
			}
		}
	}
	long long res=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(all[i][j]=='J'){
				res+=1ll*dp1[i][j]*dp2[i][j];
			}
		}
	}
	cout<<res<<"\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...