# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153282 | mhy908 | Bitaro the Brave (JOI19_ho_t1) | C++14 | 275 ms | 159384 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>
#define F first
#define S second
#define pb push_back
#define llinf 8987654321987654321
#define inf 1987654321
using namespace std;
typedef long long LL;
typedef pair<LL, LL> pll;
int n, m;
char arr[3010][3010];
LL dp1[3010][3010], dp2[3010][3010];
int main()
{
scanf("%d %d", &n, &m);
for(int i=1; i<=n; i++){
scanf("%s", arr[i]+1);
}
for(int i=n; i>=1; i--){
for(int j=1; j<=m; j++){
if(arr[i][j]=='I')dp1[i][j]=dp1[i+1][j]+1;
else dp1[i][j]=dp1[i+1][j];
}
}
for(int i=1; i<=n; i++){
for(int j=1; j<=m; j++){
if(arr[i][j]=='J')dp2[i][j]=dp2[i][j-1]+dp1[i][j];
else dp2[i][j]=dp2[i][j-1];
}
}
LL ans=0;
for(int i=1; i<=n; i++){
for(int j=1; j<=m; j++){
if(arr[i][j]=='O')ans+=dp2[i][j];
}
}
printf("%lld", 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... |