oj.uz

Submission #941481

# Submission time Handle Problem Language Result Execution time Memory
941481 2024-03-09T02:00:41 Z Programmer123 Rectangles (IOI19_rect) C++17
50 / 100
 5000 ms 86284 KB 
#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];
            }
        }
        for (int i = 1; i < N - 1; ++i) {
            for (int j = 1; j < M - 1; ++j) {
                if (a[i][j] == 0 && a[i - 1][j] == 1 && a[i][j - 1] == 1) {
                    int below = -1, right = -1;
                    for (int k = i; k < N; ++k) {
                        if (a[k][j] == 1) {
                            below = k;
                            break;
                        }
                    }
                    for (int k = j; k < M; ++k) {
                        if (a[i][k] == 1) {
                            right = k;
                            break;
                        }
                    }
                    if (below == -1 || right == -1) continue;
                    int summid = pfx[below - 1][right - 1] - pfx[below - 1][j - 1] - pfx[i - 1][right - 1] +
                                 pfx[i - 1][j - 1];
                    if (summid) continue;
                    for (int k = i; k < below; ++k) {
                        if (!(a[k][j - 1] && a[k][right])) goto stop;
                    }
                    for (int k = j; k < right; ++k) {
                        if (!(a[i - 1][k] && a[below][k])) goto stop;
                    }
                    ans++;
                    stop:;
                }
            }
        }
        return ans;
    }
    if (N == 3) {
        bool works[M];
        works[0] = false;
        works[M - 1] = false;
        for (int i = 1; i < M - 1; ++i) {
            works[i] = a[1][i] < a[0][i] && a[1][i] < a[2][i];
        }
        for (int l = 1; l < M - 1; ++l) {
            if (!works[l]) continue;
            int max = a[1][l];
            for (int r = l; r < M - 1; ++r) {
                if (!works[r]) break;
                max = std::max(max, a[1][r]);
                if (max >= a[1][l - 1]) break;
                if (max >= a[1][r + 1]) continue;
                ans++;
            }
        }
        return ans;
    }
    int max[N];
    for (int u = 1; u < N - 1; ++u) {
        int maxc[M];
        for (int i = 0; i < M; ++i) {
            maxc[i] = a[u][i];
        }
        std::vector<int> alive;
        for (int i = 1; i < M - 1; ++i) {
            alive.push_back(i);
        }
        for (int d = u; d < N - 1; ++d) {
            for (auto i: alive) {
                maxc[i] = std::max(maxc[i], a[d][i]);
            }
            bool works[M];
            std::vector<int> working, nextalive;
            for (int i = 0; i < M; ++i) {
                works[i] = maxc[i] < a[u - 1][i] && maxc[i] < a[d + 1][i];
                if (works[i]) working.push_back(i);
                if (maxc[i] < a[u - 1][i]) nextalive.push_back(i);
            }
            alive = nextalive;
            for (auto l: working) {
                for (int i = u; i <= d; ++i) {
                    max[i] = a[i][l];
                }
                for (int r = l; r < M - 1; ++r) {
                    if (!works[r]) break;
                    for (int i = u; i <= d; ++i) {
                        max[i] = std::max(max[i], a[i][r]);
                    }
                    for (int i = u; i <= d; ++i) {
                        if (max[i] >= a[i][l - 1]) goto dead;
                    }
                    for (int i = u; i <= d; ++i) {
                        if (max[i] >= a[i][r + 1]) goto next;
                    }
                    ans++;
                    next:;
                }
                dead:;
            }
        }
    }
    return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 428 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 420 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 428 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 420 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 13 ms 348 KB Output is correct
23 Correct 13 ms 512 KB Output is correct
24 Correct 13 ms 520 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 500 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 428 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 420 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 13 ms 348 KB Output is correct
18 Correct 13 ms 512 KB Output is correct
19 Correct 13 ms 520 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 500 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 468 ms 944 KB Output is correct
31 Correct 461 ms 952 KB Output is correct
32 Correct 478 ms 1032 KB Output is correct
33 Correct 15 ms 600 KB Output is correct
34 Correct 17 ms 900 KB Output is correct
35 Correct 18 ms 856 KB Output is correct
36 Correct 17 ms 860 KB Output is correct
37 Correct 17 ms 860 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 428 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 420 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 13 ms 348 KB Output is correct
18 Correct 13 ms 512 KB Output is correct
19 Correct 13 ms 520 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 500 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 468 ms 944 KB Output is correct
26 Correct 461 ms 952 KB Output is correct
27 Correct 478 ms 1032 KB Output is correct
28 Correct 15 ms 600 KB Output is correct
29 Correct 17 ms 900 KB Output is correct
30 Correct 18 ms 856 KB Output is correct
31 Correct 17 ms 860 KB Output is correct
32 Correct 17 ms 860 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 754 ms 6092 KB Output is correct
39 Correct 758 ms 6096 KB Output is correct
40 Correct 796 ms 6096 KB Output is correct
41 Correct 838 ms 6092 KB Output is correct
42 Execution timed out 5027 ms 6048 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 404 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 428 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 82 ms 37044 KB Output is correct
8 Correct 163 ms 79956 KB Output is correct
9 Correct 171 ms 86284 KB Output is correct
10 Correct 149 ms 86128 KB Output is correct
11 Correct 46 ms 42576 KB Output is correct
12 Correct 95 ms 80644 KB Output is correct
13 Correct 103 ms 86072 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 428 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 420 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 13 ms 348 KB Output is correct
18 Correct 13 ms 512 KB Output is correct
19 Correct 13 ms 520 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 500 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 468 ms 944 KB Output is correct
26 Correct 461 ms 952 KB Output is correct
27 Correct 478 ms 1032 KB Output is correct
28 Correct 15 ms 600 KB Output is correct
29 Correct 17 ms 900 KB Output is correct
30 Correct 18 ms 856 KB Output is correct
31 Correct 17 ms 860 KB Output is correct
32 Correct 17 ms 860 KB Output is correct
33 Correct 754 ms 6092 KB Output is correct
34 Correct 758 ms 6096 KB Output is correct
35 Correct 796 ms 6096 KB Output is correct
36 Correct 838 ms 6092 KB Output is correct
37 Execution timed out 5027 ms 6048 KB Time limit exceeded
38 Halted 0 ms 0 KB -