oj.uz

Submission #832192

# Submission time Handle Problem Language Result Execution time Memory
832192 2023-08-21T06:08:56 Z tranxuanbach Rectangles (IOI19_rect) C++17
100 / 100
 2805 ms 555512 KB 
#include "rect.h"

#include <bits/stdc++.h>
using namespace std;

#define For(i, l, r) for (auto i = (l); i < (r); i++)
#define ForE(i, l, r) for (auto i = (l); i <= (r); i++)
#define FordE(i, l, r) for (auto i = (l); i >= (r); i--)
#define isz(a) ((signed)a.size())

using ll = long long;

struct rectangle{
	int x1, y1, x2, y2;

	friend bool operator< (const rectangle& lhs, const rectangle& rhs){
		if (lhs.x1 != rhs.x1) return lhs.x1 < rhs.x1;
		if (lhs.y1 != rhs.y1) return lhs.y1 < rhs.y1;
		if (lhs.x2 != rhs.x2) return lhs.x2 < rhs.x2;
		return lhs.y2 < rhs.y2;
	}

	friend bool operator== (const rectangle& lhs, const rectangle& rhs){
		return lhs.x1 == rhs.x1 and lhs.y1 == rhs.y1 and lhs.x2 == rhs.x2 and lhs.y2 == rhs.y2;
	}
};

const int N = 2500 + 5;
const int inf = 1e8 + 7;

int n, m;
int a[N][N];

int nxt_l[N][N];
int nxt_r[N][N];
int nxt_u[N][N];
int nxt_d[N][N];
vector <rectangle> candidates;
vector <bool> possible;

// In the u direction
int extend_l[N][N];
int extend_r[N][N];
// In the l direction
int extend_u[N][N];
int extend_d[N][N];

ll count_rectangles(vector <vector <int>> _a){
	n = isz(_a);
	m = isz(_a.front());
	ForE(i, 0, n + 1){
		ForE(j, 0, m + 1){
			if (i == 0 or i == n + 1 or j == 0 or j == m + 1){
				a[i][j] = inf;
				continue;
			}
			a[i][j] = _a[i - 1][j - 1];
		}
	}

	ForE(i, 1, n){
		vector <int> st = {0};
		ForE(j, 1, m){
			while (a[i][st.back()] < a[i][j]){
				st.pop_back();
			}
			nxt_l[i][j] = st.back();
			st.emplace_back(j);
		}
		st = {m + 1};
		FordE(j, m, 1){
			while (a[i][st.back()] < a[i][j]){
				st.pop_back();
			}
			nxt_r[i][j] = st.back();
			st.emplace_back(j);
		}
	}
	ForE(j, 1, m){
		vector <int> st = {0};
		ForE(i, 1, n){
			while (a[st.back()][j] < a[i][j]){
				st.pop_back();
			}
			nxt_u[i][j] = st.back();
			st.emplace_back(i);
		}
		st = {n + 1};
		FordE(i, n, 1){
			while (a[st.back()][j] < a[i][j]){
				st.pop_back();
			}
			nxt_d[i][j] = st.back();
			st.emplace_back(i);
		}
	}

	ForE(i, 1, n){
		ForE(j, 1, m){
			extend_l[i][j] = extend_r[i][j] = i;
		}
		if (not (1 <= i - 1)){
			continue;
		}
		ForE(j, 1, m){
			int k = nxt_l[i][j];
			if (not (1 <= k)){
				continue;
			}
			if (nxt_l[i - 1][j] == k){
				extend_l[i][j] = min(extend_l[i][j], extend_l[i - 1][j]);
			}
			if (nxt_r[i - 1][k] == j){
				extend_l[i][j] = min(extend_l[i][j], extend_r[i - 1][k]);
			}
		}
		ForE(j, 1, m){
			int k = nxt_r[i][j];
			if (not (k <= m)){
				continue;
			}
			if (nxt_r[i - 1][j] == k){
				extend_r[i][j] = min(extend_r[i][j], extend_r[i - 1][j]);
			}
			if (nxt_l[i - 1][k] == j){
				extend_r[i][j] = min(extend_r[i][j], extend_l[i - 1][k]);
			}
		}
	}
	ForE(j, 1, m){
		ForE(i, 1, n){
			extend_u[i][j] = extend_d[i][j] = j;
		}
		if (not (1 <= j - 1)){
			continue;
		}
		ForE(i, 1, n){
			int k = nxt_u[i][j];
			if (not (1 <= k)){
				continue;
			}
			if (nxt_u[i][j - 1] == k){
				extend_u[i][j] = min(extend_u[i][j], extend_u[i][j - 1]);
			}
			if (nxt_d[k][j - 1] == i){
				extend_u[i][j] = min(extend_u[i][j], extend_d[k][j - 1]);
			}
		}
		ForE(i, 1, n){
			int k = nxt_d[i][j];
			if (not (k <= n)){
				continue;
			}
			if (nxt_d[i][j - 1] == k){
				extend_d[i][j] = min(extend_d[i][j], extend_d[i][j - 1]);
			}
			if (nxt_u[k][j - 1] == i){
				extend_d[i][j] = min(extend_d[i][j], extend_u[k][j - 1]);
			}
		}
	}

	ForE(x, 2, n - 1){
		ForE(y, 2, m - 1){
			{ // ul corner is SS
				int tx = nxt_d[x - 1][y] - 1, ty = nxt_r[x][y - 1] - 1;
				if (x <= tx and tx <= n - 1 and y <= ty and ty <= m - 1){
					candidates.emplace_back(rectangle{x, y, tx, ty});
				}
			}
			{ // ur corner is SS
				int tx = nxt_d[x - 1][y] - 1, ty = nxt_l[x][y + 1] + 1;
				if (x <= tx and tx <= n - 1 and 2 <= ty and ty <= y){
					candidates.emplace_back(rectangle{x, ty, tx, y});
				}
			}
			{ // dl corner is SS
				int tx = nxt_u[x + 1][y] + 1, ty = nxt_r[x][y - 1] - 1;
				if (2 <= tx and tx <= x and y <= ty and ty <= m - 1){
					candidates.emplace_back(rectangle{tx, y, x, ty});
				}
			}
			{ // dr corner is SS
				int tx = nxt_u[x + 1][y] + 1, ty = nxt_l[x][y + 1] + 1;
				if (2 <= tx and tx <= x and 2 <= ty and ty <= y){
					candidates.emplace_back(rectangle{tx, ty, x, y});
				}
			}
			{ // dr corner is SL
				int tx = nxt_u[x + 1][y] + 1, ty = nxt_l[tx][y + 1] + 1;
				if (2 <= tx and tx <= x and 2 <= ty and ty <= y){
					candidates.emplace_back(rectangle{tx, ty, x, y});
				}
			}
			{ // dr corner is LS
				int ty = nxt_l[x][y + 1] + 1, tx = nxt_u[x + 1][ty] + 1;
				if (2 <= tx and tx <= x and 2 <= ty and ty <= y){
					candidates.emplace_back(rectangle{tx, ty, x, y});
				}
			}
		}
	}
	sort(candidates.begin(), candidates.end());
	candidates.erase(unique(candidates.begin(), candidates.end()), candidates.end());
	possible.assign(isz(candidates), true);
	For(i, 0, isz(candidates)){
		auto &[x1, y1, x2, y2] = candidates[i];
		{
			bool ok = false;
			if (nxt_l[x2][y2 + 1] == y1 - 1){
				ok |= (extend_l[x2][y2 + 1] <= x1);
			}
			if (nxt_r[x2][y1 - 1] == y2 + 1){
				ok |= (extend_r[x2][y1 - 1] <= x1);
			}
			possible[i] = possible[i] & ok;
		}
		{
			bool ok = false;
			if (nxt_u[x2 + 1][y2] == x1 - 1){
				ok |= (extend_u[x2 + 1][y2] <= y1);
			}
			if (nxt_d[x1 - 1][y2] == x2 + 1){
				ok |= (extend_d[x1 - 1][y2] <= y1);
			}
			possible[i] = possible[i] & ok;
		}
	}

	return accumulate(possible.begin(), possible.end(), 0);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1464 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1464 KB Output is correct
6 Correct 1 ms 1468 KB Output is correct
7 Correct 1 ms 1464 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1460 KB Output is correct
21 Correct 1 ms 596 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1464 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1464 KB Output is correct
6 Correct 1 ms 1468 KB Output is correct
7 Correct 1 ms 1464 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1460 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 2 ms 3796 KB Output is correct
24 Correct 3 ms 3796 KB Output is correct
25 Correct 3 ms 3784 KB Output is correct
26 Correct 3 ms 3924 KB Output is correct
27 Correct 3 ms 3904 KB Output is correct
28 Correct 3 ms 3924 KB Output is correct
29 Correct 2 ms 3548 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1464 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1464 KB Output is correct
6 Correct 1 ms 1468 KB Output is correct
7 Correct 1 ms 1464 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 3 ms 3796 KB Output is correct
20 Correct 3 ms 3784 KB Output is correct
21 Correct 3 ms 3924 KB Output is correct
22 Correct 3 ms 3904 KB Output is correct
23 Correct 3 ms 3924 KB Output is correct
24 Correct 2 ms 3548 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 1364 KB Output is correct
28 Correct 1 ms 1460 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 11 ms 10660 KB Output is correct
31 Correct 10 ms 10672 KB Output is correct
32 Correct 12 ms 10680 KB Output is correct
33 Correct 11 ms 10556 KB Output is correct
34 Correct 18 ms 11580 KB Output is correct
35 Correct 17 ms 11704 KB Output is correct
36 Correct 16 ms 11720 KB Output is correct
37 Correct 16 ms 11616 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1464 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1464 KB Output is correct
6 Correct 1 ms 1468 KB Output is correct
7 Correct 1 ms 1464 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 3 ms 3796 KB Output is correct
20 Correct 3 ms 3784 KB Output is correct
21 Correct 3 ms 3924 KB Output is correct
22 Correct 3 ms 3904 KB Output is correct
23 Correct 3 ms 3924 KB Output is correct
24 Correct 2 ms 3548 KB Output is correct
25 Correct 11 ms 10660 KB Output is correct
26 Correct 10 ms 10672 KB Output is correct
27 Correct 12 ms 10680 KB Output is correct
28 Correct 11 ms 10556 KB Output is correct
29 Correct 18 ms 11580 KB Output is correct
30 Correct 17 ms 11704 KB Output is correct
31 Correct 16 ms 11720 KB Output is correct
32 Correct 16 ms 11616 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 1364 KB Output is correct
36 Correct 1 ms 1460 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 53 ms 47092 KB Output is correct
39 Correct 55 ms 47092 KB Output is correct
40 Correct 54 ms 47180 KB Output is correct
41 Correct 103 ms 55472 KB Output is correct
42 Correct 137 ms 55480 KB Output is correct
43 Correct 127 ms 55472 KB Output is correct
44 Correct 124 ms 55512 KB Output is correct
45 Correct 117 ms 52436 KB Output is correct
46 Correct 104 ms 55416 KB Output is correct
47 Correct 127 ms 63668 KB Output is correct
48 Correct 196 ms 63644 KB Output is correct
49 Correct 200 ms 63664 KB Output is correct
50 Correct 103 ms 44884 KB Output is correct
51 Correct 94 ms 32280 KB Output is correct
52 Correct 181 ms 63720 KB Output is correct
53 Correct 182 ms 63700 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 824 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 576 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1460 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 700 KB Output is correct
7 Correct 601 ms 198700 KB Output is correct
8 Correct 1419 ms 401248 KB Output is correct
9 Correct 1418 ms 403036 KB Output is correct
10 Correct 1394 ms 403120 KB Output is correct
11 Correct 390 ms 135076 KB Output is correct
12 Correct 829 ms 268644 KB Output is correct
13 Correct 869 ms 271764 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1464 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1464 KB Output is correct
6 Correct 1 ms 1468 KB Output is correct
7 Correct 1 ms 1464 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 3 ms 3796 KB Output is correct
20 Correct 3 ms 3784 KB Output is correct
21 Correct 3 ms 3924 KB Output is correct
22 Correct 3 ms 3904 KB Output is correct
23 Correct 3 ms 3924 KB Output is correct
24 Correct 2 ms 3548 KB Output is correct
25 Correct 11 ms 10660 KB Output is correct
26 Correct 10 ms 10672 KB Output is correct
27 Correct 12 ms 10680 KB Output is correct
28 Correct 11 ms 10556 KB Output is correct
29 Correct 18 ms 11580 KB Output is correct
30 Correct 17 ms 11704 KB Output is correct
31 Correct 16 ms 11720 KB Output is correct
32 Correct 16 ms 11616 KB Output is correct
33 Correct 53 ms 47092 KB Output is correct
34 Correct 55 ms 47092 KB Output is correct
35 Correct 54 ms 47180 KB Output is correct
36 Correct 103 ms 55472 KB Output is correct
37 Correct 137 ms 55480 KB Output is correct
38 Correct 127 ms 55472 KB Output is correct
39 Correct 124 ms 55512 KB Output is correct
40 Correct 117 ms 52436 KB Output is correct
41 Correct 104 ms 55416 KB Output is correct
42 Correct 127 ms 63668 KB Output is correct
43 Correct 196 ms 63644 KB Output is correct
44 Correct 200 ms 63664 KB Output is correct
45 Correct 103 ms 44884 KB Output is correct
46 Correct 94 ms 32280 KB Output is correct
47 Correct 181 ms 63720 KB Output is correct
48 Correct 182 ms 63700 KB Output is correct
49 Correct 1 ms 852 KB Output is correct
50 Correct 1 ms 724 KB Output is correct
51 Correct 1 ms 724 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 2 ms 852 KB Output is correct
54 Correct 1 ms 724 KB Output is correct
55 Correct 2 ms 724 KB Output is correct
56 Correct 2 ms 824 KB Output is correct
57 Correct 1 ms 724 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 576 KB Output is correct
60 Correct 1 ms 700 KB Output is correct
61 Correct 601 ms 198700 KB Output is correct
62 Correct 1419 ms 401248 KB Output is correct
63 Correct 1418 ms 403036 KB Output is correct
64 Correct 1394 ms 403120 KB Output is correct
65 Correct 390 ms 135076 KB Output is correct
66 Correct 829 ms 268644 KB Output is correct
67 Correct 869 ms 271764 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 1364 KB Output is correct
71 Correct 1 ms 1460 KB Output is correct
72 Correct 1 ms 596 KB Output is correct
73 Correct 737 ms 270700 KB Output is correct
74 Correct 766 ms 271680 KB Output is correct
75 Correct 770 ms 270780 KB Output is correct
76 Correct 1486 ms 401600 KB Output is correct
77 Correct 2159 ms 402132 KB Output is correct
78 Correct 1558 ms 307280 KB Output is correct
79 Correct 1712 ms 405372 KB Output is correct
80 Correct 2686 ms 555512 KB Output is correct
81 Correct 1704 ms 304916 KB Output is correct
82 Correct 2306 ms 538048 KB Output is correct
83 Correct 2805 ms 552868 KB Output is correct
84 Correct 1520 ms 315172 KB Output is correct
85 Correct 2653 ms 552760 KB Output is correct
86 Correct 2571 ms 544048 KB Output is correct
87 Correct 1369 ms 325684 KB Output is correct
88 Correct 2213 ms 419052 KB Output is correct
89 Correct 2194 ms 409444 KB Output is correct
90 Correct 2248 ms 406364 KB Output is correct