# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97383 | kdh9949 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 426 ms | 79896 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;
using ll = long long;
const int N = 3005;
int h, w, p[N][N], q[N][N];
char b[N][N];
ll r;
int main(){
scanf("%d%d", &h, &w);
for(int i = 1; i <= h; i++) scanf("%s", b[i] + 1);
for(int i = h; i; i--) for(int j = w; j; j--)
p[i][j] = p[i][j + 1] + (b[i][j] == 'O');
for(int i = w; i; i--) for(int j = h; j; j--)
q[j][i] = q[j + 1][i] + (b[j][i] == 'I');
for(int i = 1; i <= h; i++) for(int j = 1; j <= w; j++)
if(b[i][j] == 'J') r += p[i][j] * q[i][j];
printf("%lld\n", r);
}
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... |