# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369332 | parsabahrami | Bitaro the Brave (JOI19_ho_t1) | C++17 | 346 ms | 88700 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.
// Call my Name and Save me from The Dark
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define SZ(x) (int) x.size()
#define F first
#define S second
const int N = 3e3 + 10, MOD = 1e9 + 7;
char A[N][N]; int n, m, I[N][N], O[N][N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%s", A[i] + 1);
}
for (int i = 1; i <= n; i++) {
for (int j = m; j >= 1; j--) O[i][j] = O[i][j + 1] + (A[i][j] == 'O');
}
for (int j = 1; j <= m; j++) {
for (int i = n; i >= 1; i--) {
I[i][j] = I[i + 1][j] + (A[i][j] == 'I');
}
}
ll ret = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) if (A[i][j] == 'J') ret += 1ll * O[i][j] * I[i][j];
printf("%lld\n", ret);
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... |