oj.uz

Submission #570828

# Submission time Handle Problem Language Result Execution time Memory
570828 2022-05-31T10:40:33 Z Stickfish Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 170188 KB 
#include "rect.h"
#include <iostream>
#include <cassert>
using namespace std;
using ll = long long;

const int INF = 1e9 + 177013;

struct cell {
    short l;
    short r;
    short u;
    short d;

    cell operator+(cell a) {
        cell ans;
        ans.l = min(l, a.l);
        ans.u = min(u, a.u);
        ans.r = max(r, a.r);
        ans.d = max(d, a.d);
        return ans;
    }
};

vector<vector<cell>> cl;

ll solve_01(vector<vector<int>> a) {
    int n = a.size();
    int m = a[0].size();
    vector<int> height(m, n + 123);
    vector<int> wall(m, 0);
    for (int i = n - 1; i >= n - 2; --i) {
        for (int j = 0; j < m; ++j) {
            if (a[i][j] == 0) {
                ++height[j];
                wall[j] = 0;
            } else {
                ++wall[j];
                height[j] = 0;
            }
        }
    }
    ll ans = 0;
    for (int i = n - 3; i >= 0; --i) {
        int pv0 = -123;
        for (int j = 0; j < m; ++j) {
            if (height[j] == 0) {
                if (pv0 != -123 && pv0 != j - 1) {
                    bool isok = min(wall[j], wall[pv0]) >= height[pv0 + 1];
                    for (int k = pv0 + 1; k < j && isok; ++k) {
                        if (k > pv0 + 1)
                            isok &= height[k] == height[k - 1];
                        isok &= a[i][k] == 1;
                    }
                    if (isok) {
                        cerr << i << ' ' << pv0 << ' ' << j << endl;
                        ++ans;
                    }
                }
                pv0 = j;
            }
        }
        for (int j = 0; j < m; ++j) {
            if (a[i][j] == 0) {
                ++height[j];
                wall[j] = 0;
            } else {
                ++wall[j];
                height[j] = 0;
            }
        }
    }
    return ans;
}

ll count_rectangles(vector<vector<int>> a) {
    int n = a.size();
    int m = a[0].size();
    bool all_01 = true;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            all_01 &= a[i][j] < 2;
        }
    }
    if (all_01 && n >= 3 && m >= 3)
        return solve_01(a);
    cl.assign(n, vector<cell>(m));
    for (int i = 0; i < n; ++i) {
        vector<pair<int, int>> stck = {{INF, -1}};
        for (int j = 0; j < m; ++j) {
            while (stck.back().first <= a[i][j])
                stck.pop_back();
            cl[i][j].l = stck.back().second;
            stck.push_back({a[i][j], j});
        }
    }
    for (int i = 0; i < n; ++i) {
        vector<pair<int, int>> stck = {{INF, m}};
        for (int j = m - 1; j >= 0; --j) {
            while (stck.back().first <= a[i][j])
                stck.pop_back();
            cl[i][j].r = stck.back().second;
            stck.push_back({a[i][j], j});
        }
    }
    for (int j = 0; j < m; ++j) {
        vector<pair<int, int>> stck = {{INF, -1}};
        for (int i = 0; i < n; ++i) {
            while (stck.back().first <= a[i][j])
                stck.pop_back();
            cl[i][j].u = stck.back().second;
            stck.push_back({a[i][j], i});
        }
    }
    for (int j = 0; j < m; ++j) {
        vector<pair<int, int>> stck = {{INF, n}};
        for (int i = n - 1; i >= 0; --i) {
            while (stck.back().first <= a[i][j])
                stck.pop_back();
            cl[i][j].d = stck.back().second;
            stck.push_back({a[i][j], i});
        }
    }
    vector<vector<cell>> colmn(n, vector<cell>(m));
    ll ans = 0;
    for (int i = n - 2; i > 0; --i) {
        for (int j = m - 2; j > 0; --j) {
            colmn[i][j] = cl[i][j];
            for (int u = i; u < n - 1; ++u) {
                cell board = cl[i][j];
                for (int v = j; v < m - 1; ++v) {
                    if (u > i)
                        colmn[u][v] = colmn[u][v] + cl[i][v];
                    board = board + colmn[u][v];
                    if (board.u < i - 1 || board.l < j - 1 || board.d > u + 1)
                        break;
                    if (board.r <= v + 1) {
                        ++ans;
                    }
                }
            }
        }
    }
	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 5 ms 484 KB Output is correct
23 Correct 5 ms 468 KB Output is correct
24 Correct 5 ms 468 KB Output is correct
25 Correct 4 ms 432 KB Output is correct
26 Correct 4 ms 468 KB Output is correct
27 Correct 4 ms 468 KB Output is correct
28 Correct 4 ms 480 KB Output is correct
29 Correct 2 ms 340 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 5 ms 484 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 468 KB Output is correct
20 Correct 4 ms 432 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 4 ms 480 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 64 ms 1468 KB Output is correct
31 Correct 67 ms 1364 KB Output is correct
32 Correct 64 ms 1492 KB Output is correct
33 Correct 40 ms 1332 KB Output is correct
34 Correct 40 ms 1364 KB Output is correct
35 Correct 41 ms 1584 KB Output is correct
36 Correct 42 ms 1492 KB Output is correct
37 Correct 41 ms 1492 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 5 ms 484 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 468 KB Output is correct
20 Correct 4 ms 432 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 4 ms 480 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 64 ms 1468 KB Output is correct
26 Correct 67 ms 1364 KB Output is correct
27 Correct 64 ms 1492 KB Output is correct
28 Correct 40 ms 1332 KB Output is correct
29 Correct 40 ms 1364 KB Output is correct
30 Correct 41 ms 1584 KB Output is correct
31 Correct 42 ms 1492 KB Output is correct
32 Correct 41 ms 1492 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 1870 ms 15036 KB Output is correct
39 Correct 1790 ms 15036 KB Output is correct
40 Correct 1659 ms 15036 KB Output is correct
41 Correct 1805 ms 15036 KB Output is correct
42 Correct 3173 ms 15144 KB Output is correct
43 Correct 3068 ms 15168 KB Output is correct
44 Correct 2793 ms 15500 KB Output is correct
45 Correct 2450 ms 14636 KB Output is correct
46 Correct 152 ms 7240 KB Output is correct
47 Correct 1619 ms 12860 KB Output is correct
48 Correct 1643 ms 13736 KB Output is correct
49 Correct 1678 ms 15596 KB Output is correct
50 Correct 802 ms 7960 KB Output is correct
51 Correct 448 ms 7944 KB Output is correct
52 Correct 1647 ms 14668 KB Output is correct
53 Correct 1685 ms 15692 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 468 KB Output is correct
2 Correct 8 ms 516 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 436 KB Output is correct
8 Correct 2 ms 436 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 440 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 874 ms 41120 KB Output is correct
8 Correct 1887 ms 89172 KB Output is correct
9 Correct 1876 ms 89732 KB Output is correct
10 Correct 1874 ms 89604 KB Output is correct
11 Correct 53 ms 42592 KB Output is correct
12 Correct 103 ms 80892 KB Output is correct
13 Correct 102 ms 86132 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 5 ms 484 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 468 KB Output is correct
20 Correct 4 ms 432 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 4 ms 480 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 64 ms 1468 KB Output is correct
26 Correct 67 ms 1364 KB Output is correct
27 Correct 64 ms 1492 KB Output is correct
28 Correct 40 ms 1332 KB Output is correct
29 Correct 40 ms 1364 KB Output is correct
30 Correct 41 ms 1584 KB Output is correct
31 Correct 42 ms 1492 KB Output is correct
32 Correct 41 ms 1492 KB Output is correct
33 Correct 1870 ms 15036 KB Output is correct
34 Correct 1790 ms 15036 KB Output is correct
35 Correct 1659 ms 15036 KB Output is correct
36 Correct 1805 ms 15036 KB Output is correct
37 Correct 3173 ms 15144 KB Output is correct
38 Correct 3068 ms 15168 KB Output is correct
39 Correct 2793 ms 15500 KB Output is correct
40 Correct 2450 ms 14636 KB Output is correct
41 Correct 152 ms 7240 KB Output is correct
42 Correct 1619 ms 12860 KB Output is correct
43 Correct 1643 ms 13736 KB Output is correct
44 Correct 1678 ms 15596 KB Output is correct
45 Correct 802 ms 7960 KB Output is correct
46 Correct 448 ms 7944 KB Output is correct
47 Correct 1647 ms 14668 KB Output is correct
48 Correct 1685 ms 15692 KB Output is correct
49 Correct 11 ms 468 KB Output is correct
50 Correct 8 ms 516 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 2 ms 468 KB Output is correct
54 Correct 2 ms 468 KB Output is correct
55 Correct 2 ms 436 KB Output is correct
56 Correct 2 ms 436 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 2 ms 440 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 874 ms 41120 KB Output is correct
62 Correct 1887 ms 89172 KB Output is correct
63 Correct 1876 ms 89732 KB Output is correct
64 Correct 1874 ms 89604 KB Output is correct
65 Correct 53 ms 42592 KB Output is correct
66 Correct 103 ms 80892 KB Output is correct
67 Correct 102 ms 86132 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 300 KB Output is correct
73 Execution timed out 5038 ms 170188 KB Time limit exceeded
74 Halted 0 ms 0 KB -