# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134423 | Boxworld | Bitaro the Brave (JOI19_ho_t1) | C++14 | 6 ms | 2044 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;
const int maxN=3010;
int h[maxN],w[maxN],ans=0;
char s[maxN][maxN];
int main(){
int n,m;
scanf("%d%d",&n,&m);
memset(h,0,sizeof(h));
memset(w,0,sizeof(w));
for (int i=0;i<n;i++)scanf("%s",s[i]);
for (int i=n-1;i>=0;i--)
for (int j=m-1;j>=0;j--){
if (s[i][j]=='O')h[i]++;
if (s[i][j]=='I')w[j]++;
if (s[i][j]=='J')ans+=h[i]*w[j];
}
printf("%d\n",ans);
}
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... |