# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731110 | sleepntsheep | Bitaro the Brave (JOI19_ho_t1) | C++17 | 886 ms | 256100 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;
const int N = 3005;
int n, m;
long long ans;
int a[N][N];
int fr[N][N][3], fc[N][N][3];
const std::string JOI = "JOI";
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++)
{
char c;
scanf(" %c", &c);
int x = std::find(JOI.begin(), JOI.end(), c) - JOI.begin();
++fr[i][j][x]; ++fc[j][i][x];
a[i][j] = x;
}
for (int j = 1; j <= m; j++) for (int i = n; i >= 1; i--)
fc[j][i][2] += fc[j][i+1][2];
for (int i = 1; i <= n; i++) for (int j = m; j >= 1; j--)
fr[i][j][1] += fr[i][j+1][1];
for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++)
{
if (a[i][j] == 0)
{
ans += 1ll * fr[i][j][1] * 1ll * fc[j][i][2];
}
}
printf("%lld", 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... |