# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97610 | maruii | Bitaro the Brave (JOI19_ho_t1) | C++14 | 129 ms | 79708 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;
char s[3005][3005];
int H, W, O[3005][3005], I[3005][3005];
int main(){
scanf("%d%d",&H,&W);
for(int i=0; i<H; ++i) scanf("%s",s[i]);
long long ans=0;
for(int i=H-1; i>=0; --i)
for(int j=W-1; j>=0; --j)
O[i][j] = O[i][j+1]+(s[i][j]=='O'), I[i][j] = I[i+1][j]+(s[i][j]=='I'), ans += (s[i][j]=='J')*O[i][j]*I[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... |