# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218074 | KoalaMuch | Bitaro the Brave (JOI19_ho_t1) | C++14 | 125 ms | 44408 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 N = 3005;
int dp[N][N];
char s[N];
int main()
{
int n,m;
long long ans = 0;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf(" %s",s+1);
int O = 0;
for(int j=m;j>=1;j--)
{
dp[i][j] = dp[i-1][j];
if(s[j]=='J') dp[i][j]+=O;
else if(s[j]=='O') ++O;
else ans+=dp[i-1][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... |