# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
603270 | IvanJ | Bitaro the Brave (JOI19_ho_t1) | C++17 | 61 ms | 17956 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;
typedef long long ll;
const int maxn = 3005;
int n, m;
char mat[maxn][maxn];
int O[maxn], I[maxn];
int main() {
scanf("%d%d", &n, &m);
for(int i = 0;i < n;i++) scanf("%s", mat[i]);
ll ans = 0;
for(int i = n - 1;i >= 0;i--) {
for(int j = m - 1;j >= 0;j--) {
O[i] += (mat[i][j] == 'O');
I[j] += (mat[i][j] == 'I');
ans += (ll)(mat[i][j] == 'J') * (O[i] * 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... |