# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
539776 | krit3379 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 280 ms | 88500 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define N 3005
int a[N][N],b[N][N];
long long ans;
char s[N][N];
int main(){
int n,m,i,j;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++){
scanf(" %s",s[i]+1);
}
for(i=1;i<=n;i++){
for(j=m;j>0;j--){
if(s[i][j]=='O')a[i][j]++;
a[i][j]+=a[i][j+1];
}
}
for(i=1;i<=m;i++){
for(j=n;j>0;j--){
if(s[j][i]=='I')b[j][i]++;
b[j][i]+=b[j+1][i];
}
}
for(i=1;i<=n;i++)for(j=1;j<=m;j++)if(s[i][j]=='J')ans+=a[i][j]*b[i][j];
printf("%lld",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |