Submission #1277204

#TimeUsernameProblemLanguageResultExecution timeMemory
1277204PieArmyBitaro the Brave (JOI19_ho_t1)C++20
100 / 100
291 ms70988 KiB
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define fr first
#define sc second
#define endl '\n'
using namespace std;

int n,m;
int orb[3001][3001],in[3001][3001];

int main(){
	ios_base::sync_with_stdio(23^23);cin.tie(NULL);
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			char c;cin>>c;
			if(c=='O'){
				orb[i][j]++;
			}
			if(c=='I'){
				in[i][j]++;
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=m-1;j>=0;j--){
			orb[i][j]+=orb[i][j+1];
		}
	}
	for(int j=0;j<m;j++){
		for(int i=n-1;i>=0;i--){
			in[i][j]+=in[i+1][j];
		}
	}
	ll ans=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(orb[i][j]==orb[i][j+1]&&in[i][j]==in[i+1][j]){
				ans+=orb[i][j]*in[i][j];
			}
		}
	}
	cout<<ans<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...