| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 586951 | Justin1 | Bitaro the Brave (JOI19_ho_t1) | C++14 | 767 ms | 159032 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>
#define ll long long
using namespace std;
ll n,m,k,x,y,z;
ll O[3005][3005], I[3005][3005];
char ar[3005][3005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> ar[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = m; j >= 1; j--) O[i][j] = O[i][j+1] + (ar[i][j] == 'O');
}
for (int i = 1; i <= m; i++) {
for (int j = n; j >= 1; j--) I[j][i] = I[j+1][i] + (ar[j][i] == 'I');
}
ll ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (ar[i][j] == 'J') ans += O[i][j] * I[i][j];
}
}
cout << ans << "\n";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
