# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1047827 | manhlinh1501 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 113 ms | 88660 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 i64 = long long;
const int MAXN = 3e3 + 5;
int N, M;
char a[MAXN][MAXN];
int cO[MAXN][MAXN];
int cI[MAXN][MAXN];
signed main() {
#define TASK "code"
if (fopen(TASK ".inp", "r")) {
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N >> M;
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= M; j++)
cin >> a[i][j];
}
for(int i = 1; i <= N; i++) {
int cnt = 0;
for(int j = M; j >= 1; j--) {
if(a[i][j] == 'O')
cnt++;
cO[i][j] = cnt;
}
}
for(int j = 1; j <= M; j++) {
int cnt = 0;
for(int i = N; i >= 1; i--) {
if(a[i][j] == 'I')
cnt++;
cI[i][j] = cnt;
}
}
i64 ans = 0;
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= M; j++) {
if(a[i][j] == 'J')
ans += 1LL * cO[i][j] * cI[i][j];
}
}
cout << ans;
return (0 ^ 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... |