oj.uz

Submission #810405

# Submission time Handle Problem Language Result Execution time Memory
810405 2023-08-06T09:17:58 Z NothingXD Rectangles (IOI19_rect) C++17
100 / 100
 2482 ms 728616 KB 
#include "rect.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef double ld;

void debug_out(){cerr<<endl;}
template<typename Head, typename... Tail> 
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 3e3 + 10;
const int lg = 20;

int n, m, spt[lg][maxn], a[maxn][maxn], l[maxn][maxn], r[maxn][maxn], u[maxn][maxn], d[maxn][maxn], ans[maxn][maxn];
int L[maxn][maxn], R[maxn][maxn], U[maxn][maxn], D[maxn][maxn];
vector<pii> Q[maxn][4];

struct rect{
	int a, b, c, d;
};

int getmin(int l, int r){
	r++;
	int x = 31 - __builtin_clz(r-l);
	return min(spt[x][l], spt[x][r-(1<<x)]);
}

int getmax(int l, int r){
	r++;
	int x = 31 - __builtin_clz(r-l);
	return max(spt[x][l], spt[x][r-(1<<x)]);
}

ll count_rectangles(vector<vector<int>> A) {
	n = A.size();
	m = A[0].size();
	//debug(n, m);
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			a[i][j] = A[i][j];
			//		debug(i, j, a[i][j]);
		}
	}
	//	debug(1);
	for (int i = 0; i < n; i++){
		vector<int> v;
		for (int j = 0; j < m; j++){
			l[i][j] = -1;
			while (!v.empty() && a[i][v.back()] <= a[i][j]) v.pop_back();
			if (!v.empty()) l[i][j] = v.back();
			v.push_back(j);
		}
		v.clear();
		for (int j = m-1; ~j; j--){
			r[i][j] = m;
			while (!v.empty() && a[i][v.back()] <= a[i][j]) v.pop_back();
			if (!v.empty()){
				r[i][j] = v.back();
				//	debug(i, j, v.back(), a[i][j], a[i][v.back()]);
			}
			v.push_back(j);
		}
	}
	//	debug(2);
	for (int j = 0; j < m; j++){
		vector<int> v;
		for (int i = 0; i < n; i++){
			u[i][j] = -1;
			while (!v.empty() && a[v.back()][j] <= a[i][j]) v.pop_back();
			if (!v.empty()) u[i][j] = v.back();
			v.push_back(i);
		}
		v.clear();
		for (int i = n-1; ~i; i--){
			d[i][j] = n;
			while (!v.empty() && a[v.back()][j] <= a[i][j]){
				//debug(i, j, v.back(), a[v.back()][j], a[i][j]);
				v.pop_back();
			}
			if (!v.empty()) d[i][j] = v.back();
			v.push_back(i);
		}
	}
	//	debug(3);
	for (int x = 0; x < n; x++){
		for (int y = 0; y < m; y++){
			//			debug(x, y, l[x][y], r[x][y], u[x][y], d[x][y]);
			if (l[x][y] == -1 || r[x][y] == m || d[x][y] == n || u[x][y] == -1) continue;
			//			debug(1);
			Q[l[x][y]][0].push_back({x, y});
			Q[r[x][y]][1].push_back({x, y});
			Q[u[x][y]][2].push_back({x, y});
			Q[d[x][y]][3].push_back({x, y});
		}
	}
	for (int i = 0; i < n; i++){
		vector<int> v;
		for (int j = 0; j < m; j++){
			L[i][j] = -1;
			while (!v.empty() && a[i][v.back()] < a[i][j]) v.pop_back();
			if (!v.empty()) L[i][j] = v.back();
			v.push_back(j);
		}
		v.clear();
		for (int j = m-1; ~j; j--){
			R[i][j] = m;
			while (!v.empty() && a[i][v.back()] < a[i][j]) v.pop_back();
			if (!v.empty()){
				R[i][j] = v.back();
				//	debug(i, j, v.back(), a[i][j], a[i][v.back()]);
			}
			v.push_back(j);
		}
	}
	//	debug(2);
	for (int j = 0; j < m; j++){
		vector<int> v;
		for (int i = 0; i < n; i++){
			U[i][j] = -1;
			while (!v.empty() && a[v.back()][j] < a[i][j]) v.pop_back();
			if (!v.empty()) U[i][j] = v.back();
			v.push_back(i);
		}
		v.clear();
		for (int i = n-1; ~i; i--){
			D[i][j] = n;
			while (!v.empty() && a[v.back()][j] < a[i][j]){
				//debug(i, j, v.back(), a[v.back()][j], a[i][j]);
				v.pop_back();
			}
			if (!v.empty()) D[i][j] = v.back();
			v.push_back(i);
		}
	}


	//	debug(4);
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			spt[0][j] = U[i][j];
		}
		for (int j = 1; j < lg; j++){
			for (int k = 0; k + (1 << j) <= m; k++){
				spt[j][k] = max(spt[j-1][k], spt[j-1][k+(1<<(j-1))]);
			}
		}
		for (auto [x, y]: Q[i][3]){
			if (getmax(l[x][y]+1, r[x][y]-1) <= u[x][y]) ans[x][y]++;
		}
		for (int j = 0; j < m; j++){
			spt[0][j] = D[i][j];
		}
		for (int j = 1; j < lg; j++){
			for (int k = 0; k + (1 << j) <= m; k++){
				spt[j][k] = min(spt[j-1][k], spt[j-1][k+(1<<(j-1))]);
			}
		}
		for (auto [x, y]: Q[i][2]){
			if (getmin(l[x][y]+1, r[x][y]-1) >= d[x][y]) ans[x][y]++;
		}
	}
	//	debug(5);
	for (int j = 0; j < m; j++){
		//		debug(j);
		for (int i = 0; i < n; i++){
			spt[0][i] = L[i][j];
		}
		for (int i = 1; i < lg; i++){
			for (int k = 0; k + (1 << i) <= n; k++){
				spt[i][k] = max(spt[i-1][k], spt[i-1][k+(1<<(i-1))]);
			}
		}
		//		debug(1);
		for (auto [x, y]: Q[j][1]){
			if (getmax(u[x][y]+1, d[x][y]-1) <= l[x][y]) ans[x][y]++;
		}
		//		debug(2);
		for (int i = 0; i < n; i++){
			spt[0][i] = R[i][j];
		}
		for (int i = 1; i < lg; i++){
			for (int k = 0; k + (1 << i) <= n; k++){
				spt[i][k] = min(spt[i-1][k], spt[i-1][k+(1<<(i-1))]);
			}
		}
		//	debug(3);
		for (auto [x, y]: Q[j][0]){
			if (getmin(u[x][y]+1, d[x][y]-1) >= r[x][y]) ans[x][y]++;
		}
		//	debug(4);
	}
	vector<pair<pii,pii>> res;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			if (ans[i][j] == 4) res.push_back({{l[i][j]+1, r[i][j]-1}, {u[i][j]+1, d[i][j]-1}});
		}
	}
	sort(all(res));
	res.resize(distance(res.begin(), unique(all(res))));
	/*for (auto [a, b]: res){
		debug(a.F, a.S, b.F, b.S);
	}*/
	return res.size();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 0 ms 596 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 1 ms 1748 KB Output is correct
21 Correct 1 ms 980 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 0 ms 596 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 1 ms 1748 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 3 ms 4564 KB Output is correct
23 Correct 4 ms 4564 KB Output is correct
24 Correct 3 ms 4564 KB Output is correct
25 Correct 3 ms 4308 KB Output is correct
26 Correct 4 ms 4436 KB Output is correct
27 Correct 4 ms 4436 KB Output is correct
28 Correct 3 ms 4436 KB Output is correct
29 Correct 4 ms 4096 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 3 ms 4564 KB Output is correct
18 Correct 4 ms 4564 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 3 ms 4308 KB Output is correct
21 Correct 4 ms 4436 KB Output is correct
22 Correct 4 ms 4436 KB Output is correct
23 Correct 3 ms 4436 KB Output is correct
24 Correct 4 ms 4096 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 0 ms 596 KB Output is correct
27 Correct 2 ms 1876 KB Output is correct
28 Correct 1 ms 1748 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 15 ms 13304 KB Output is correct
31 Correct 14 ms 13248 KB Output is correct
32 Correct 14 ms 13384 KB Output is correct
33 Correct 12 ms 12116 KB Output is correct
34 Correct 20 ms 12760 KB Output is correct
35 Correct 16 ms 12892 KB Output is correct
36 Correct 16 ms 13316 KB Output is correct
37 Correct 16 ms 12760 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 3 ms 4564 KB Output is correct
18 Correct 4 ms 4564 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 3 ms 4308 KB Output is correct
21 Correct 4 ms 4436 KB Output is correct
22 Correct 4 ms 4436 KB Output is correct
23 Correct 3 ms 4436 KB Output is correct
24 Correct 4 ms 4096 KB Output is correct
25 Correct 15 ms 13304 KB Output is correct
26 Correct 14 ms 13248 KB Output is correct
27 Correct 14 ms 13384 KB Output is correct
28 Correct 12 ms 12116 KB Output is correct
29 Correct 20 ms 12760 KB Output is correct
30 Correct 16 ms 12892 KB Output is correct
31 Correct 16 ms 13316 KB Output is correct
32 Correct 16 ms 12760 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 0 ms 596 KB Output is correct
35 Correct 2 ms 1876 KB Output is correct
36 Correct 1 ms 1748 KB Output is correct
37 Correct 1 ms 980 KB Output is correct
38 Correct 75 ms 53036 KB Output is correct
39 Correct 78 ms 52964 KB Output is correct
40 Correct 71 ms 52984 KB Output is correct
41 Correct 72 ms 52944 KB Output is correct
42 Correct 172 ms 82196 KB Output is correct
43 Correct 168 ms 82224 KB Output is correct
44 Correct 189 ms 82544 KB Output is correct
45 Correct 163 ms 78276 KB Output is correct
46 Correct 114 ms 65488 KB Output is correct
47 Correct 140 ms 66756 KB Output is correct
48 Correct 187 ms 81808 KB Output is correct
49 Correct 226 ms 83820 KB Output is correct
50 Correct 105 ms 55808 KB Output is correct
51 Correct 87 ms 42104 KB Output is correct
52 Correct 185 ms 82160 KB Output is correct
53 Correct 182 ms 83140 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 2 ms 1364 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 0 ms 724 KB Output is correct
5 Correct 2 ms 1236 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 2 ms 1236 KB Output is correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 2 ms 1236 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 1 ms 980 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 596 KB Output is correct
3 Correct 2 ms 1876 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 672 ms 246832 KB Output is correct
8 Correct 1557 ms 504764 KB Output is correct
9 Correct 1475 ms 507032 KB Output is correct
10 Correct 1499 ms 506992 KB Output is correct
11 Correct 409 ms 155852 KB Output is correct
12 Correct 887 ms 311932 KB Output is correct
13 Correct 932 ms 314988 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 3 ms 4564 KB Output is correct
18 Correct 4 ms 4564 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 3 ms 4308 KB Output is correct
21 Correct 4 ms 4436 KB Output is correct
22 Correct 4 ms 4436 KB Output is correct
23 Correct 3 ms 4436 KB Output is correct
24 Correct 4 ms 4096 KB Output is correct
25 Correct 15 ms 13304 KB Output is correct
26 Correct 14 ms 13248 KB Output is correct
27 Correct 14 ms 13384 KB Output is correct
28 Correct 12 ms 12116 KB Output is correct
29 Correct 20 ms 12760 KB Output is correct
30 Correct 16 ms 12892 KB Output is correct
31 Correct 16 ms 13316 KB Output is correct
32 Correct 16 ms 12760 KB Output is correct
33 Correct 75 ms 53036 KB Output is correct
34 Correct 78 ms 52964 KB Output is correct
35 Correct 71 ms 52984 KB Output is correct
36 Correct 72 ms 52944 KB Output is correct
37 Correct 172 ms 82196 KB Output is correct
38 Correct 168 ms 82224 KB Output is correct
39 Correct 189 ms 82544 KB Output is correct
40 Correct 163 ms 78276 KB Output is correct
41 Correct 114 ms 65488 KB Output is correct
42 Correct 140 ms 66756 KB Output is correct
43 Correct 187 ms 81808 KB Output is correct
44 Correct 226 ms 83820 KB Output is correct
45 Correct 105 ms 55808 KB Output is correct
46 Correct 87 ms 42104 KB Output is correct
47 Correct 185 ms 82160 KB Output is correct
48 Correct 182 ms 83140 KB Output is correct
49 Correct 2 ms 1364 KB Output is correct
50 Correct 2 ms 1364 KB Output is correct
51 Correct 2 ms 1108 KB Output is correct
52 Correct 0 ms 724 KB Output is correct
53 Correct 2 ms 1236 KB Output is correct
54 Correct 2 ms 1236 KB Output is correct
55 Correct 2 ms 1236 KB Output is correct
56 Correct 2 ms 1236 KB Output is correct
57 Correct 2 ms 1236 KB Output is correct
58 Correct 2 ms 852 KB Output is correct
59 Correct 1 ms 980 KB Output is correct
60 Correct 1 ms 980 KB Output is correct
61 Correct 672 ms 246832 KB Output is correct
62 Correct 1557 ms 504764 KB Output is correct
63 Correct 1475 ms 507032 KB Output is correct
64 Correct 1499 ms 506992 KB Output is correct
65 Correct 409 ms 155852 KB Output is correct
66 Correct 887 ms 311932 KB Output is correct
67 Correct 932 ms 314988 KB Output is correct
68 Correct 1 ms 596 KB Output is correct
69 Correct 0 ms 596 KB Output is correct
70 Correct 2 ms 1876 KB Output is correct
71 Correct 1 ms 1748 KB Output is correct
72 Correct 1 ms 980 KB Output is correct
73 Correct 1065 ms 326980 KB Output is correct
74 Correct 1082 ms 327156 KB Output is correct
75 Correct 1105 ms 327160 KB Output is correct
76 Correct 1066 ms 327156 KB Output is correct
77 Correct 2452 ms 704276 KB Output is correct
78 Correct 1422 ms 404176 KB Output is correct
79 Correct 1483 ms 489288 KB Output is correct
80 Correct 2290 ms 693496 KB Output is correct
81 Correct 1417 ms 424704 KB Output is correct
82 Correct 1910 ms 587140 KB Output is correct
83 Correct 2412 ms 710008 KB Output is correct
84 Correct 1451 ms 421048 KB Output is correct
85 Correct 2420 ms 703692 KB Output is correct
86 Correct 2473 ms 683524 KB Output is correct
87 Correct 1496 ms 508940 KB Output is correct
88 Correct 2479 ms 728316 KB Output is correct
89 Correct 2458 ms 728588 KB Output is correct
90 Correct 2482 ms 728616 KB Output is correct