# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835304 | EntityPlantt | Strah (COCI18_strah) | C++14 | 1063 ms | 19788 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 <cstdio>
char c;
int i, j, k, l, m, n, p[2001][2001], r;
int main() {
scanf("%d%d", &m, &n);
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf(" %c", &c);
p[i + 1][j + 1] = p[i][j + 1] + p[i + 1][j] - p[i][j] + (c == '#');
}
}
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
for (k = i + 1; k <= m; k++) {
for (l = j + 1; l <= n; l++) {
if (p[k][l] - p[i][l] - p[k][j] + p[i][j] == 0) {
r += (k - i) * (l - j);
}
}
}
}
}
printf("%d", r);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |