# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941481 | Programmer123 | Rectangles (IOI19_rect) | C++17 | 5027 ms | 86284 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.
#ifndef LOCAL
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,sse4.2")
#endif
#include "rect.h"
long long count_rectangles(std::vector<std::vector<int> > a) {
int N = a.size();
int M = a[0].size();
int maxv = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < M; ++j) {
maxv = std::max(maxv, a[i][j]);
}
}
if (maxv == 0) return 0;
long long ans = 0;
if (maxv == 1) {
int pfx[N][M];
pfx[0][0] = a[0][0];
for (int i = 1; i < M; ++i) {
pfx[0][i] = a[0][i] + pfx[0][i - 1];
}
for (int i = 1; i < N; ++i) {
pfx[i][0] = a[i][0] + pfx[i - 1][0];
for (int j = 1; j < M; ++j) {
pfx[i][j] = a[i][j] + pfx[i - 1][j] + pfx[i][j - 1] - pfx[i - 1][j - 1];
}
}
# | 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... |