oj.uz

Submission #823815

# Submission time Handle Problem Language Result Execution time Memory
823815 2023-08-13T07:31:25 Z dxz05 Rectangles (IOI19_rect) C++17
100 / 100
 4977 ms 673324 KB 
// #pragma GCC optimize("Ofast,O3,unroll-loops")
// #pragma GCC target("avx,avx2")

#include "rect.h"
#include <bits/stdc++.h>

using namespace std;

vector<pair<int, int>> find_borders(const vector<int> &a){
	int n = (int) a.size();

	stack<int> st;
	vector<int> l(n), r(n);
	for (int i = 0; i < n; i++){
		while (!st.empty() && a[st.top()] < a[i]) st.pop();
		l[i] = (st.empty() ? -1 : st.top());
		st.push(i);
	}

	while (!st.empty()) st.pop();

	for (int i = n - 1; i >= 0; i--){
		while (!st.empty() && a[st.top()] < a[i]) st.pop();
		r[i] = (st.empty() ? n : st.top());
		st.push(i);
	}

	vector<pair<int, int>> ans;
	set<pair<int, int>> s1; // (i, r[i])
	set<pair<int, int>> s2; // (r[i], i)
	for (int j = 0; j < n; j++){
		while (!s2.empty()){
			int i = s2.begin()->second;
			if (r[i] < j){
				s1.erase(make_pair(i, r[i]));
				s2.erase(make_pair(r[i], i));
			} else {
				break;
			}
		}

		assert(s1.size() == s2.size());

		auto it = s1.end();
		while (true){
			if (it == s1.begin()) break;
			it--;

			int i = it->first;
			if (i < l[j]) break;

			if (i + 1 < j) ans.emplace_back(i + 1, j - 1);
		}

		s1.emplace(j, r[j]);
		s2.emplace(r[j], j);
	}

	return ans;
}

const int MaxN = 2500;

vector<pair<int, int>> per_col[MaxN][MaxN];
vector<pair<int, int>> per_row[MaxN][MaxN];

vector<tuple<int, int, int>> opening[MaxN];
vector<pair<int, int>> vals_to_add[MaxN];

int fen[MaxN + 1][MaxN + 1];

void add(int _x, int _y, int val){
	_x++, _y++;
	int x = _x;
	while (x <= MaxN){
		int y = _y;
		while (y <= MaxN){
			fen[x][y] += val;
			y += (-y & y);
		}
		x += (-x & x);
	}
}

int get(int _x, int _y){
	_x++, _y++;
	int res = 0;
	int x = _x;
	while (x > 0){
		int y = _y;
		while (y > 0){
			res += fen[x][y];
			y -= (-y & y);
		}
		x -= (-x & x);
	}
	return res;
}

long long count_rectangles(vector<vector<int>> A) {
	int n = (int) A.size(), m = (int) A[0].size();

	for (int i = 1; i + 1 < n; i++){
		vector<pair<int, int>> f = find_borders(A[i]);

		for (auto [l, r] : f){
			auto &v = per_col[l][r];
			if (v.empty() || v.back().second != i - 1){
				v.emplace_back(i, i);
			} else {
				v.back().second++;
			}
		}
	}

	for (int j = 1; j + 1 < m; j++){
		vector<int> col(n);
		for (int i = 0; i < n; i++) col[i] = A[i][j];
		vector<pair<int, int>> f = find_borders(col);
		for (auto [x, y] : f){
			auto &v = per_row[x][y];
			if (v.empty() || v.back().second != j - 1){
				v.emplace_back(j, j);
			} else {
				v.back().second++;
			}
		}
	}

	for (int x = 0; x < n; x++){
		for (int y = x; y < n; y++){
			for (auto [l, r] : per_row[x][y]){
				opening[l].emplace_back(r, x, y);
			}
		}
	}

	long long ans = 0;
	for (int l = 1; l < m - 1; l++){
		for (auto [r, x, y] : opening[l]){
			vals_to_add[r].emplace_back(x, y);
		}

 		for (int r = m - 2; r >= l; r--){
			for (auto [x, y] : vals_to_add[r]){
				x = n - x - 1;
				add(x, y, 1);
			}

			for (auto [X, Y] : per_col[l][r]){
				X = n - X - 1;
				ans += get(X, Y);
			}

		}

		for (int r = l; r <= m - 2; r++){
			for (auto [x, y] : vals_to_add[r]){
				x = n - x - 1;
				add(x, y, -1);
			}
		}
	}

	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294040 KB Output is correct
2 Correct 143 ms 294272 KB Output is correct
3 Correct 152 ms 294248 KB Output is correct
4 Correct 127 ms 294348 KB Output is correct
5 Correct 129 ms 293920 KB Output is correct
6 Correct 131 ms 294380 KB Output is correct
7 Correct 128 ms 294300 KB Output is correct
8 Correct 130 ms 294124 KB Output is correct
9 Correct 129 ms 294284 KB Output is correct
10 Correct 130 ms 294348 KB Output is correct
11 Correct 131 ms 294376 KB Output is correct
12 Correct 129 ms 294364 KB Output is correct
13 Correct 129 ms 293836 KB Output is correct
14 Correct 144 ms 293968 KB Output is correct
15 Correct 131 ms 293852 KB Output is correct
16 Correct 131 ms 294056 KB Output is correct
17 Correct 130 ms 293884 KB Output is correct
18 Correct 129 ms 293940 KB Output is correct
19 Correct 150 ms 294308 KB Output is correct
20 Correct 129 ms 293916 KB Output is correct
21 Correct 139 ms 293892 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294040 KB Output is correct
2 Correct 143 ms 294272 KB Output is correct
3 Correct 152 ms 294248 KB Output is correct
4 Correct 127 ms 294348 KB Output is correct
5 Correct 129 ms 293920 KB Output is correct
6 Correct 131 ms 294380 KB Output is correct
7 Correct 128 ms 294300 KB Output is correct
8 Correct 130 ms 294124 KB Output is correct
9 Correct 129 ms 294284 KB Output is correct
10 Correct 130 ms 294348 KB Output is correct
11 Correct 131 ms 294376 KB Output is correct
12 Correct 129 ms 294364 KB Output is correct
13 Correct 129 ms 293836 KB Output is correct
14 Correct 144 ms 293968 KB Output is correct
15 Correct 131 ms 293852 KB Output is correct
16 Correct 131 ms 294056 KB Output is correct
17 Correct 130 ms 293884 KB Output is correct
18 Correct 129 ms 293940 KB Output is correct
19 Correct 150 ms 294308 KB Output is correct
20 Correct 129 ms 293916 KB Output is correct
21 Correct 139 ms 293892 KB Output is correct
22 Correct 131 ms 294772 KB Output is correct
23 Correct 136 ms 294832 KB Output is correct
24 Correct 132 ms 294780 KB Output is correct
25 Correct 132 ms 294988 KB Output is correct
26 Correct 134 ms 295024 KB Output is correct
27 Correct 134 ms 295052 KB Output is correct
28 Correct 133 ms 294996 KB Output is correct
29 Correct 131 ms 294852 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294040 KB Output is correct
2 Correct 143 ms 294272 KB Output is correct
3 Correct 152 ms 294248 KB Output is correct
4 Correct 127 ms 294348 KB Output is correct
5 Correct 129 ms 293920 KB Output is correct
6 Correct 131 ms 294380 KB Output is correct
7 Correct 128 ms 294300 KB Output is correct
8 Correct 130 ms 294124 KB Output is correct
9 Correct 129 ms 294284 KB Output is correct
10 Correct 130 ms 294348 KB Output is correct
11 Correct 131 ms 294376 KB Output is correct
12 Correct 129 ms 294364 KB Output is correct
13 Correct 129 ms 293836 KB Output is correct
14 Correct 144 ms 293968 KB Output is correct
15 Correct 131 ms 293852 KB Output is correct
16 Correct 131 ms 294056 KB Output is correct
17 Correct 131 ms 294772 KB Output is correct
18 Correct 136 ms 294832 KB Output is correct
19 Correct 132 ms 294780 KB Output is correct
20 Correct 132 ms 294988 KB Output is correct
21 Correct 134 ms 295024 KB Output is correct
22 Correct 134 ms 295052 KB Output is correct
23 Correct 133 ms 294996 KB Output is correct
24 Correct 131 ms 294852 KB Output is correct
25 Correct 130 ms 293884 KB Output is correct
26 Correct 129 ms 293940 KB Output is correct
27 Correct 150 ms 294308 KB Output is correct
28 Correct 129 ms 293916 KB Output is correct
29 Correct 139 ms 293892 KB Output is correct
30 Correct 149 ms 296360 KB Output is correct
31 Correct 149 ms 296288 KB Output is correct
32 Correct 150 ms 296312 KB Output is correct
33 Correct 145 ms 297136 KB Output is correct
34 Correct 159 ms 298192 KB Output is correct
35 Correct 157 ms 298236 KB Output is correct
36 Correct 156 ms 297752 KB Output is correct
37 Correct 156 ms 297700 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294040 KB Output is correct
2 Correct 143 ms 294272 KB Output is correct
3 Correct 152 ms 294248 KB Output is correct
4 Correct 127 ms 294348 KB Output is correct
5 Correct 129 ms 293920 KB Output is correct
6 Correct 131 ms 294380 KB Output is correct
7 Correct 128 ms 294300 KB Output is correct
8 Correct 130 ms 294124 KB Output is correct
9 Correct 129 ms 294284 KB Output is correct
10 Correct 130 ms 294348 KB Output is correct
11 Correct 131 ms 294376 KB Output is correct
12 Correct 129 ms 294364 KB Output is correct
13 Correct 129 ms 293836 KB Output is correct
14 Correct 144 ms 293968 KB Output is correct
15 Correct 131 ms 293852 KB Output is correct
16 Correct 131 ms 294056 KB Output is correct
17 Correct 131 ms 294772 KB Output is correct
18 Correct 136 ms 294832 KB Output is correct
19 Correct 132 ms 294780 KB Output is correct
20 Correct 132 ms 294988 KB Output is correct
21 Correct 134 ms 295024 KB Output is correct
22 Correct 134 ms 295052 KB Output is correct
23 Correct 133 ms 294996 KB Output is correct
24 Correct 131 ms 294852 KB Output is correct
25 Correct 149 ms 296360 KB Output is correct
26 Correct 149 ms 296288 KB Output is correct
27 Correct 150 ms 296312 KB Output is correct
28 Correct 145 ms 297136 KB Output is correct
29 Correct 159 ms 298192 KB Output is correct
30 Correct 157 ms 298236 KB Output is correct
31 Correct 156 ms 297752 KB Output is correct
32 Correct 156 ms 297700 KB Output is correct
33 Correct 130 ms 293884 KB Output is correct
34 Correct 129 ms 293940 KB Output is correct
35 Correct 150 ms 294308 KB Output is correct
36 Correct 129 ms 293916 KB Output is correct
37 Correct 139 ms 293892 KB Output is correct
38 Correct 409 ms 327076 KB Output is correct
39 Correct 381 ms 327116 KB Output is correct
40 Correct 369 ms 327136 KB Output is correct
41 Correct 373 ms 327184 KB Output is correct
42 Correct 361 ms 304640 KB Output is correct
43 Correct 390 ms 304492 KB Output is correct
44 Correct 374 ms 304600 KB Output is correct
45 Correct 391 ms 303960 KB Output is correct
46 Correct 282 ms 311432 KB Output is correct
47 Correct 310 ms 312100 KB Output is correct
48 Correct 477 ms 328972 KB Output is correct
49 Correct 493 ms 329260 KB Output is correct
50 Correct 307 ms 315340 KB Output is correct
51 Correct 304 ms 311992 KB Output is correct
52 Correct 467 ms 319796 KB Output is correct
53 Correct 461 ms 319896 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 294460 KB Output is correct
2 Correct 142 ms 294456 KB Output is correct
3 Correct 143 ms 293944 KB Output is correct
4 Correct 133 ms 293876 KB Output is correct
5 Correct 143 ms 294264 KB Output is correct
6 Correct 155 ms 294220 KB Output is correct
7 Correct 165 ms 294176 KB Output is correct
8 Correct 143 ms 294248 KB Output is correct
9 Correct 144 ms 294172 KB Output is correct
10 Correct 143 ms 293952 KB Output is correct
11 Correct 141 ms 293948 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 293884 KB Output is correct
2 Correct 129 ms 293940 KB Output is correct
3 Correct 150 ms 294308 KB Output is correct
4 Correct 129 ms 293916 KB Output is correct
5 Correct 139 ms 293892 KB Output is correct
6 Correct 129 ms 294092 KB Output is correct
7 Correct 1042 ms 369448 KB Output is correct
8 Correct 2382 ms 451668 KB Output is correct
9 Correct 2140 ms 452108 KB Output is correct
10 Correct 2116 ms 452372 KB Output is correct
11 Correct 754 ms 318216 KB Output is correct
12 Correct 1293 ms 340044 KB Output is correct
13 Correct 1389 ms 343096 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294040 KB Output is correct
2 Correct 143 ms 294272 KB Output is correct
3 Correct 152 ms 294248 KB Output is correct
4 Correct 127 ms 294348 KB Output is correct
5 Correct 129 ms 293920 KB Output is correct
6 Correct 131 ms 294380 KB Output is correct
7 Correct 128 ms 294300 KB Output is correct
8 Correct 130 ms 294124 KB Output is correct
9 Correct 129 ms 294284 KB Output is correct
10 Correct 130 ms 294348 KB Output is correct
11 Correct 131 ms 294376 KB Output is correct
12 Correct 129 ms 294364 KB Output is correct
13 Correct 129 ms 293836 KB Output is correct
14 Correct 144 ms 293968 KB Output is correct
15 Correct 131 ms 293852 KB Output is correct
16 Correct 131 ms 294056 KB Output is correct
17 Correct 131 ms 294772 KB Output is correct
18 Correct 136 ms 294832 KB Output is correct
19 Correct 132 ms 294780 KB Output is correct
20 Correct 132 ms 294988 KB Output is correct
21 Correct 134 ms 295024 KB Output is correct
22 Correct 134 ms 295052 KB Output is correct
23 Correct 133 ms 294996 KB Output is correct
24 Correct 131 ms 294852 KB Output is correct
25 Correct 149 ms 296360 KB Output is correct
26 Correct 149 ms 296288 KB Output is correct
27 Correct 150 ms 296312 KB Output is correct
28 Correct 145 ms 297136 KB Output is correct
29 Correct 159 ms 298192 KB Output is correct
30 Correct 157 ms 298236 KB Output is correct
31 Correct 156 ms 297752 KB Output is correct
32 Correct 156 ms 297700 KB Output is correct
33 Correct 409 ms 327076 KB Output is correct
34 Correct 381 ms 327116 KB Output is correct
35 Correct 369 ms 327136 KB Output is correct
36 Correct 373 ms 327184 KB Output is correct
37 Correct 361 ms 304640 KB Output is correct
38 Correct 390 ms 304492 KB Output is correct
39 Correct 374 ms 304600 KB Output is correct
40 Correct 391 ms 303960 KB Output is correct
41 Correct 282 ms 311432 KB Output is correct
42 Correct 310 ms 312100 KB Output is correct
43 Correct 477 ms 328972 KB Output is correct
44 Correct 493 ms 329260 KB Output is correct
45 Correct 307 ms 315340 KB Output is correct
46 Correct 304 ms 311992 KB Output is correct
47 Correct 467 ms 319796 KB Output is correct
48 Correct 461 ms 319896 KB Output is correct
49 Correct 165 ms 294460 KB Output is correct
50 Correct 142 ms 294456 KB Output is correct
51 Correct 143 ms 293944 KB Output is correct
52 Correct 133 ms 293876 KB Output is correct
53 Correct 143 ms 294264 KB Output is correct
54 Correct 155 ms 294220 KB Output is correct
55 Correct 165 ms 294176 KB Output is correct
56 Correct 143 ms 294248 KB Output is correct
57 Correct 144 ms 294172 KB Output is correct
58 Correct 143 ms 293952 KB Output is correct
59 Correct 141 ms 293948 KB Output is correct
60 Correct 129 ms 294092 KB Output is correct
61 Correct 1042 ms 369448 KB Output is correct
62 Correct 2382 ms 451668 KB Output is correct
63 Correct 2140 ms 452108 KB Output is correct
64 Correct 2116 ms 452372 KB Output is correct
65 Correct 754 ms 318216 KB Output is correct
66 Correct 1293 ms 340044 KB Output is correct
67 Correct 1389 ms 343096 KB Output is correct
68 Correct 130 ms 293884 KB Output is correct
69 Correct 129 ms 293940 KB Output is correct
70 Correct 150 ms 294308 KB Output is correct
71 Correct 129 ms 293916 KB Output is correct
72 Correct 139 ms 293892 KB Output is correct
73 Correct 3989 ms 639020 KB Output is correct
74 Correct 3583 ms 639008 KB Output is correct
75 Correct 3620 ms 633664 KB Output is correct
76 Correct 3000 ms 633056 KB Output is correct
77 Correct 3018 ms 353640 KB Output is correct
78 Correct 2963 ms 520200 KB Output is correct
79 Correct 3157 ms 522276 KB Output is correct
80 Correct 4977 ms 626624 KB Output is correct
81 Correct 3062 ms 537140 KB Output is correct
82 Correct 3998 ms 596700 KB Output is correct
83 Correct 4968 ms 673324 KB Output is correct
84 Correct 2818 ms 471024 KB Output is correct
85 Correct 4628 ms 585412 KB Output is correct
86 Correct 4387 ms 574700 KB Output is correct
87 Correct 1839 ms 362708 KB Output is correct
88 Correct 3124 ms 378548 KB Output is correct
89 Correct 3029 ms 378552 KB Output is correct
90 Correct 3160 ms 378552 KB Output is correct