# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444128 | nonsensenonsense1 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 142 ms | 88292 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 <cstdio>
const int N = 3001;
int h, w, o[N][N], in[N][N];
char s[N][N];
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');
in[i][j] = in[i + 1][j] + (s[i][j] == 'I');
if (s[i][j] == 'J') ans += o[i][j] * in[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... |