# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253388 | ChrisT | Bitaro the Brave (JOI19_ho_t1) | C++17 | 106 ms | 17916 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;
char grid[3005][3005]; int col[3005], row[3005];
int main () {
int n,m;
scanf ("%d %d",&n,&m);
for (int i = 1; i <= n; i++) scanf ("%s",grid[i]+1);
long long ans = 0;
for (int i = n; i >= 1; i--) {
for (int j = m; j >= 1; j--) {
if (grid[i][j] == 'J') ans += row[i] * col[j];
else if (grid[i][j] == 'O') ++row[i];
else ++col[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... |