oj.uz

Submission #737683

# Submission time Handle Problem Language Result Execution time Memory
737683 2023-05-07T14:34:54 Z rnl42 Rectangles (IOI19_rect) C++14
100 / 100
 3784 ms 459856 KB 
#include "rect.h"
#include <stack>
#include <algorithm>
using namespace std;

enum {
	TOP = 0,
	BOTTOM = 1,
	LEFT = 2,
	RIGHT = 3,
};

struct Case {
	int next[4] = {-1, -1, -1, -1};
	bool hasrect() {
		return next[0] != -1 && next[1] != -1 && next[2] != -1 && next[3] != -1;
	}
};

struct Rect1d {
	int a, b, w = 1;
	bool operator<(const Rect1d& other) const {
		return a == other.a ? b < other.b : a < other.a;
	}
	bool operator==(const Rect1d& other) const {
		return a == other.a && b == other.b;
	}
};

struct Rectangle {
	int r1, c1, r2, c2;
	bool operator<(const Rectangle& other) const {
		if (r1 != other.r1)
			return r1 < other.r1;
		if (c1 != other.c1)
			return c1 < other.c1;
		if (r2 != other.r2)
			return r2 < other.r2;
		if (c2 != other.c2)
			return c2 < other.c2;
		return false;
	}
	bool operator==(const Rectangle& other) const {
		return r1 == other.r1 && c1 == other.c1 && r2 == other.r2 && c2 == other.c2;
	}
};

long long count_rectangles(vector<vector<int>> A) {
	const int R = A.size(), C = A[0].size();

	vector<vector<Case>> cases(R, vector<Case>(C));
	stack<int> dec_seq;
	for (int r = 0; r < R; r++) {
		for (int c = 0; c < C; c++) {
			while (!dec_seq.empty() && A[r][dec_seq.top()] < A[r][c]) {
				dec_seq.pop();
			}
			if (!dec_seq.empty() && A[r][dec_seq.top()] > A[r][c]) cases[r][c].next[LEFT] = dec_seq.top();
			dec_seq.push(c);
		}
		while (!dec_seq.empty()) dec_seq.pop();
		for (int c = C-1; c >= 0; c--) {
			while (!dec_seq.empty() && A[r][dec_seq.top()] <= A[r][c]) {
				dec_seq.pop();
			}
			if (!dec_seq.empty()) cases[r][c].next[RIGHT] = dec_seq.top();
			dec_seq.push(c);
		}
		while (!dec_seq.empty()) dec_seq.pop();
	}

	for (int c = 0; c < C; c++) {
		for (int r = 0; r < R; r++) {
			while (!dec_seq.empty() && A[dec_seq.top()][c] < A[r][c]) {
				dec_seq.pop();
			}
			if (!dec_seq.empty() && A[dec_seq.top()][c] > A[r][c]) cases[r][c].next[TOP] = dec_seq.top();
			dec_seq.push(r);
		}
		while (!dec_seq.empty()) dec_seq.pop();
		for (int r = R-1; r >= 0; r--) {
			while (!dec_seq.empty() && A[dec_seq.top()][c] <= A[r][c]) {
				dec_seq.pop();
			}
			if (!dec_seq.empty()) cases[r][c].next[BOTTOM] = dec_seq.top();
			dec_seq.push(r);
		}
		while (!dec_seq.empty()) dec_seq.pop();
	}

	vector<Rectangle> rects;
	for (int r = 0; r < R; r++) {
		for (int c = 0; c < C; c++) {
			if (cases[r][c].hasrect()) {
				rects.push_back({cases[r][c].next[TOP]+1, cases[r][c].next[LEFT]+1, cases[r][c].next[BOTTOM]-1, cases[r][c].next[RIGHT]-1});
			}
		}
	}
	sort(rects.begin(), rects.end());
	rects.resize(unique(rects.begin(), rects.end()) - rects.begin());

	vector<vector<Rect1d>> rect1ds[2];
	rect1ds[0].resize(R);
	rect1ds[1].resize(C);
	for (int r = 0; r < R; r++) {
		for (int c = 0; c < C; c++) {
			if (cases[r][c].next[LEFT] != -1 && cases[r][c].next[RIGHT] != -1) {
				Rect1d newr = {cases[r][c].next[LEFT]+1, cases[r][c].next[RIGHT]-1};
				if (r > 0) {
					auto it = lower_bound(rect1ds[0][r-1].begin(), rect1ds[0][r-1].end(), newr);
					if (it != rect1ds[0][r-1].end() && *it == newr) {
						newr.w = 1+it->w;
					}
				}
				rect1ds[0][r].push_back(newr);
			}
		}
		sort(rect1ds[0][r].begin(), rect1ds[0][r].end());
	}

	for (int c = 0; c < C; c++) {
		for (int r = 0; r < R; r++) {
			if (cases[r][c].next[TOP] != -1 && cases[r][c].next[BOTTOM] != -1) {
				Rect1d newr = {cases[r][c].next[TOP]+1, cases[r][c].next[BOTTOM]-1};
				if (c > 0) {
					auto it = lower_bound(rect1ds[1][c-1].begin(), rect1ds[1][c-1].end(), newr);
					if (it != rect1ds[1][c-1].end() && *it == newr) {
						newr.w = 1+it->w;
					}
				}
				rect1ds[1][c].push_back(newr);
			}
		}
		sort(rect1ds[1][c].begin(), rect1ds[1][c].end());
	}

	int ans = 0;
	for (auto& r : rects) {
		auto& v = rect1ds[0][r.r2];
		auto it = lower_bound(v.begin(), v.end(), Rect1d{r.c1, r.c2});
		if (it != v.end() && *it == Rect1d{r.c1, r.c2} && it->w >= r.r2-r.r1+1) {
			auto& v = rect1ds[1][r.c2];
			auto it = lower_bound(v.begin(), v.end(), Rect1d{r.r1, r.r2});
			if (it != v.end() && *it == Rect1d{r.r1, r.r2} && it->w >= r.c2-r.c1+1) {
				ans++;
			}
		}
	}

	return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 808 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 3 ms 676 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 3 ms 724 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 11 ms 3252 KB Output is correct
31 Correct 10 ms 3272 KB Output is correct
32 Correct 11 ms 3356 KB Output is correct
33 Correct 8 ms 2000 KB Output is correct
34 Correct 22 ms 3116 KB Output is correct
35 Correct 23 ms 3260 KB Output is correct
36 Correct 19 ms 3204 KB Output is correct
37 Correct 16 ms 3232 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 808 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 3 ms 676 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 3 ms 724 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 11 ms 3252 KB Output is correct
26 Correct 10 ms 3272 KB Output is correct
27 Correct 11 ms 3356 KB Output is correct
28 Correct 8 ms 2000 KB Output is correct
29 Correct 22 ms 3116 KB Output is correct
30 Correct 23 ms 3260 KB Output is correct
31 Correct 19 ms 3204 KB Output is correct
32 Correct 16 ms 3232 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 62 ms 23320 KB Output is correct
39 Correct 60 ms 23332 KB Output is correct
40 Correct 59 ms 23480 KB Output is correct
41 Correct 66 ms 23572 KB Output is correct
42 Correct 150 ms 39624 KB Output is correct
43 Correct 157 ms 39620 KB Output is correct
44 Correct 175 ms 39940 KB Output is correct
45 Correct 149 ms 37888 KB Output is correct
46 Correct 65 ms 17936 KB Output is correct
47 Correct 94 ms 22936 KB Output is correct
48 Correct 256 ms 37684 KB Output is correct
49 Correct 247 ms 39836 KB Output is correct
50 Correct 119 ms 20192 KB Output is correct
51 Correct 128 ms 19936 KB Output is correct
52 Correct 242 ms 36692 KB Output is correct
53 Correct 240 ms 38008 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 696 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 409 ms 100744 KB Output is correct
8 Correct 953 ms 227392 KB Output is correct
9 Correct 947 ms 228580 KB Output is correct
10 Correct 974 ms 228696 KB Output is correct
11 Correct 173 ms 78920 KB Output is correct
12 Correct 323 ms 149756 KB Output is correct
13 Correct 350 ms 159580 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 808 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 3 ms 676 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 3 ms 724 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 11 ms 3252 KB Output is correct
26 Correct 10 ms 3272 KB Output is correct
27 Correct 11 ms 3356 KB Output is correct
28 Correct 8 ms 2000 KB Output is correct
29 Correct 22 ms 3116 KB Output is correct
30 Correct 23 ms 3260 KB Output is correct
31 Correct 19 ms 3204 KB Output is correct
32 Correct 16 ms 3232 KB Output is correct
33 Correct 62 ms 23320 KB Output is correct
34 Correct 60 ms 23332 KB Output is correct
35 Correct 59 ms 23480 KB Output is correct
36 Correct 66 ms 23572 KB Output is correct
37 Correct 150 ms 39624 KB Output is correct
38 Correct 157 ms 39620 KB Output is correct
39 Correct 175 ms 39940 KB Output is correct
40 Correct 149 ms 37888 KB Output is correct
41 Correct 65 ms 17936 KB Output is correct
42 Correct 94 ms 22936 KB Output is correct
43 Correct 256 ms 37684 KB Output is correct
44 Correct 247 ms 39836 KB Output is correct
45 Correct 119 ms 20192 KB Output is correct
46 Correct 128 ms 19936 KB Output is correct
47 Correct 242 ms 36692 KB Output is correct
48 Correct 240 ms 38008 KB Output is correct
49 Correct 2 ms 696 KB Output is correct
50 Correct 2 ms 596 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 2 ms 596 KB Output is correct
54 Correct 2 ms 596 KB Output is correct
55 Correct 2 ms 596 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 596 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 409 ms 100744 KB Output is correct
62 Correct 953 ms 227392 KB Output is correct
63 Correct 947 ms 228580 KB Output is correct
64 Correct 974 ms 228696 KB Output is correct
65 Correct 173 ms 78920 KB Output is correct
66 Correct 323 ms 149756 KB Output is correct
67 Correct 350 ms 159580 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1078 ms 281908 KB Output is correct
74 Correct 944 ms 282300 KB Output is correct
75 Correct 995 ms 282456 KB Output is correct
76 Correct 873 ms 282200 KB Output is correct
77 Correct 2449 ms 459824 KB Output is correct
78 Correct 2150 ms 261248 KB Output is correct
79 Correct 2254 ms 284800 KB Output is correct
80 Correct 3658 ms 428460 KB Output is correct
81 Correct 2153 ms 278852 KB Output is correct
82 Correct 2840 ms 360516 KB Output is correct
83 Correct 3784 ms 457280 KB Output is correct
84 Correct 2045 ms 256144 KB Output is correct
85 Correct 3481 ms 433548 KB Output is correct
86 Correct 3336 ms 421460 KB Output is correct
87 Correct 1365 ms 280272 KB Output is correct
88 Correct 2526 ms 458904 KB Output is correct
89 Correct 2447 ms 459436 KB Output is correct
90 Correct 2473 ms 459856 KB Output is correct