# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154200 | ivandasfs | Bitaro the Brave (JOI19_ho_t1) | C++14 | 173 ms | 88460 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 <iostream>
#include <cstdio>
using namespace std;
char a[3005][3005];
int red[3005][3005];
int stu[3005][3005];
int main() {
int n,m;
scanf("%d%d", &n, &m);
for (int i=0 ; i<n ; i++) {
scanf("%s", a[i]);
}
long long sol = 0;
for (int i=n-1 ; i>=0 ; i--) {
for (int j=m-1 ; j>=0 ; j--) {
red[i][j] = red[i][j+1] + (a[i][j] == 'O');
stu[i][j] = stu[i+1][j] + (a[i][j] == 'I');
if (a[i][j] == 'J') sol += red[i][j] * stu[i][j];
}
}
printf("%lld\n", sol);
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... |