# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97384 | Bruteforceman | Bitaro the Brave (JOI19_ho_t1) | C++11 | 157 ms | 44664 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 s[3003][3003];
int cnt[3003][3003];
int main(int argc, char const *argv[])
{
int n, m;
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++) {
scanf("%s", s[i] + 1);
}
for(int i = n; i >= 1; i--) {
for(int j = 1; j <= m; j++) {
cnt[i][j] = cnt[i + 1][j] + (s[i][j] == 'I');
}
}
long long ans = 0;
for(int i = 1; i <= n; i++) {
int orb = 0;
for(int j = m; j >= 1; j--) {
orb += (s[i][j] == 'O');
if(s[i][j] == 'J') {
ans += cnt[i][j] * orb;
}
}
}
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... |