# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145178 | TadijaSebez | Bitaro the Brave (JOI19_ho_t1) | C++11 | 152 ms | 89848 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 ll long long
const int N=3050;
char s[N][N];
int I[N][N],O[N][N];
int main()
{
int n,m;
scanf("%i %i",&n,&m);
for(int i=1;i<=n;i++) scanf("%s",s[i]+1);
ll ans=0;
for(int i=n;i>=1;i--)
{
for(int j=m;j>=1;j--)
{
O[i][j]=O[i][j+1]+(s[i][j]=='O');
I[i][j]=I[i+1][j]+(s[i][j]=='I');
if(s[i][j]=='J') ans+=(ll)O[i][j]*I[i][j];
}
}
printf("%lld\n",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... |