# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97296 | RezwanArefin01 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 357 ms | 79996 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 = 3010;
int n, m, r[N][N], c[N][N];
char s[N][N];
int main(int argc, char const *argv[]) {
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++)
scanf(" %s", s[i] + 1);
for(int i = 1; i <= n; i++)
for(int j = m; j >= 1; j--)
r[i][j] = r[i][j + 1] + (s[i][j] == 'O');
for(int j = 1; j <= m; j++)
for(int i = n; i >= 1; i--)
c[i][j] = c[i + 1][j] + (s[i][j] == 'I');
long long ans = 0;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
ans += (s[i][j] == 'J') * r[i][j] * c[i][j];
printf("%lld\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... |