oj.uz

Submission #835937

# Submission time Handle Problem Language Result Execution time Memory
835937 2023-08-23T23:27:07 Z Lobo Rectangles (IOI19_rect) C++17
100 / 100
 4778 ms 773628 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(),x.end()
 
const int maxn = 2550;
const int inf = 1e9+10;
int n, m, a[maxn][maxn];
int lf[maxn][maxn], rg[maxn][maxn], up[maxn][maxn], dw[maxn][maxn];
vector<pair<pair<int,int>,pair<int,int>>> ans;
 
 
struct seg1 {
	int mn[(1<<13)+10];
	vector<int> vec;
	void build(vector<int> create) {
		vec = create;
		upd(1,0,(int) vec.size()-1);
 
	}
	void upd(int no, int l, int r) {
		if(l == r) {
			mn[no] = vec[l];
			return;
		}
		int lc=2*no,rc=2*no+1,mid=(l+r)>>1;
		upd(lc,l,mid);
		upd(rc,mid+1,r);
		mn[no] = min(mn[lc],mn[rc]);
	}
 
	int qry(int no, int l, int r, int ll, int rr) {
		if(l > rr || r < ll) return inf;
		if(l >= ll && r <= rr) return mn[no];
		int lc=2*no,rc=2*no+1,mid=(l+r)>>1;
		return min(qry(lc,l,mid,ll,rr),qry(rc,mid+1,r,ll,rr));
	}
 
}segrg[maxn], segdw[maxn];

struct seg2 {
	int mx[(1<<13)+10];
	vector<int> vec;
	void build(vector<int> create) {
		vec = create;
		upd(1,0,(int) vec.size()-1);
 
	}
	void upd(int no, int l, int r) {
		if(l == r) {
			mx[no] = vec[l];
			return;
		}
		int lc=2*no,rc=2*no+1,mid=(l+r)>>1;
		upd(lc,l,mid);
		upd(rc,mid+1,r);
		mx[no] = max(mx[lc],mx[rc]);
	}
 
	int qry(int no, int l, int r, int ll, int rr) {
		if(l > rr || r < ll) return -inf;
		if(l >= ll && r <= rr) return mx[no];
		int lc=2*no,rc=2*no+1,mid=(l+r)>>1;
		return max(qry(lc,l,mid,ll,rr),qry(rc,mid+1,r,ll,rr));
	}
 
}seglf[maxn], segup[maxn];

int check(int r1, int r2, int c1, int c2) {
	if(c1 > c2 || r1 > r2 || c1 == -1 || c1 == m || c2 == -1 || c2 == m || r1 == -1 || r1 == n || r2 == -1 || r2 == n) return 0;
	if(c1 == 0 || c2 == m-1 || r1 == 0 || r2 == n-1) return 0;
 
	int mxlf = -1; mxlf = seglf[c2+1].qry(1,0,n-1,r1,r2);
	// for(int i = r1; i <= r2; i++) mxlf = max(mxlf,lf[i][c2+1]);
	int mnrg = m; mnrg = segrg[c1-1].qry(1,0,n-1,r1,r2);
	// for(int i = r1; i <= r2; i++) mnrg = min(mnrg,rg[i][c1-1]);
	int mxup = -1; mxup = segup[r2+1].qry(1,0,m-1,c1,c2);;
	// for(int j = c1; j <= c2; j++) mxup = max(mxup,up[r2+1][j]);
	int mndw = n; mndw = segdw[r1-1].qry(1,0,m-1,c1,c2);
	// for(int j = c1; j <= c2; j++) mndw = min(mndw,dw[r1-1][j]);
 
	if(mxlf < c1 && mnrg > c2 && mxup < r1 && mndw > r2) {
		ans.pb(mp(mp(r1,r2),mp(c1,c2)));
		return 1;
	}
	return 0;
}
 
long long count_rectangles(std::vector<std::vector<int>> A) {
	n = A.size();
	m = A[0].size();
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			a[i][j] = A[i][j];
		}
	}
 
	// primeiro >=
	for(int i = 0; i < n; i++) {
		stack<pair<int,int>> stk;
		// left
		for(int j = 0; j < m; j++) {
			while(stk.size() && stk.top().fr < a[i][j]) stk.pop();
			if(stk.size() == 0) lf[i][j] = -1;
			else lf[i][j] = stk.top().sc;
			stk.push(mp(a[i][j],j));
		}
 
		while(stk.size()) stk.pop();
 
		// right
		for(int j = m-1; j >= 0; j--) {
			while(stk.size() && stk.top().fr < a[i][j]) stk.pop();
			if(stk.size() == 0) rg[i][j] = m;
			else rg[i][j] = stk.top().sc;
			stk.push(mp(a[i][j],j));
		}
	}
 
	for(int j = 0; j < m; j++) {
		stack<pair<int,int>> stk;
		//up
		for(int i = 0; i < n; i++) {
			while(stk.size() && stk.top().fr < a[i][j]) stk.pop();
			if(stk.size() == 0) up[i][j] = -1;
			else up[i][j] = stk.top().sc;
			stk.push(mp(a[i][j],i));
		}
 
		while(stk.size()) stk.pop();
 
		// down
		for(int i = n-1; i >= 0; i--) {
			while(stk.size() && stk.top().fr < a[i][j]) stk.pop();
			if(stk.size() == 0) dw[i][j] = n;
			else dw[i][j] = stk.top().sc;
			stk.push(mp(a[i][j],i));
		}
	}
 
	for(int i = 0; i < n; i++) {
		vector<int> vec;
		for(int j = 0; j < m; j++) {
			vec.pb(up[i][j]);
		}
 
		segup[i].build(vec);
 
		vec.clear();
		for(int j = 0; j < m; j++) {
			vec.pb(dw[i][j]);
		}
		segdw[i].build(vec);
	}
 
	for(int j = 0; j < m; j++) {
		vector<int> vec;
		for(int i = 0; i < n; i++) {
			vec.pb(lf[i][j]);
		}
 
		seglf[j].build(vec);
 
		vec.clear();
		for(int i = 0; i < n; i++) {
			vec.pb(rg[i][j]);
		}
		segrg[j].build(vec);
	}
 
	// for(int r1 = 1; r1 < n-1; r1++) {
	// 	for(int r2 = r1; r2 < n-1; r2++) {
	// 		for(int c1 = 1; c1 < m-1; c1++) {
	// 			for(int c2 = c1; c2 < m-1; c2++) {
	// 				if(check(r1,r2,c1,c2)) ans.insert(mp(mp(r1,r2),mp(c1,c2)));
	// 			}
	// 		}
	// 	}
	// }
 
	for(int r1 = 1; r1 < n-1; r1++) {
		for(int c1 = 1; c1 < m-1; c1++) {
			int r2,c2;

			r2 = dw[r1-1][c1]-1;
			c2 = min(rg[r1][c1-1]-1,rg[r2][c1-1]-1);
			check(r1,r2,c1,c2);
		}
	}
 
	for(int r1 = 1; r1 < n-1; r1++) {
		for(int c2 = 1; c2 < m-1; c2++) {
			int r2,c1;

			r2 = dw[r1-1][c2]-1;
			c1 = max(lf[r1][c2+1]+1,lf[r2][c2+1]+1);
			check(r1,r2,c1,c2);
		}
	}
	for(int r2 = 1; r2 < n-1; r2++) {
		for(int c1 = 1; c1 < m-1; c1++) {
			int r1,c2;

			r1 = up[r2+1][c1]+1;
			c2 = rg[r2][c1-1]-1;
			check(r1,r2,c1,c2);
		}
	}
 
	for(int r2 = 1; r2 < n-1; r2++) {
		for(int c2 = 1; c2 < m-1; c2++) {
			int r1,c1;

			r1 = up[r2+1][c2]+1;
			c1 = lf[r2][c2+1]+1;
			check(r1,r2,c1,c2);
		}
	}

	sort(all(ans));
	ans.erase(unique(all(ans)),ans.end());
	return ans.size();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 41812 KB Output is correct
2 Correct 13 ms 42324 KB Output is correct
3 Correct 13 ms 42324 KB Output is correct
4 Correct 13 ms 42324 KB Output is correct
5 Correct 13 ms 42324 KB Output is correct
6 Correct 17 ms 42324 KB Output is correct
7 Correct 18 ms 42324 KB Output is correct
8 Correct 16 ms 41940 KB Output is correct
9 Correct 14 ms 42324 KB Output is correct
10 Correct 13 ms 42324 KB Output is correct
11 Correct 17 ms 42348 KB Output is correct
12 Correct 13 ms 42324 KB Output is correct
13 Correct 12 ms 41684 KB Output is correct
14 Correct 15 ms 41932 KB Output is correct
15 Correct 13 ms 41940 KB Output is correct
16 Correct 13 ms 41812 KB Output is correct
17 Correct 13 ms 41684 KB Output is correct
18 Correct 12 ms 41684 KB Output is correct
19 Correct 13 ms 42324 KB Output is correct
20 Correct 13 ms 42336 KB Output is correct
21 Correct 13 ms 41940 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 41812 KB Output is correct
2 Correct 13 ms 42324 KB Output is correct
3 Correct 13 ms 42324 KB Output is correct
4 Correct 13 ms 42324 KB Output is correct
5 Correct 13 ms 42324 KB Output is correct
6 Correct 17 ms 42324 KB Output is correct
7 Correct 18 ms 42324 KB Output is correct
8 Correct 16 ms 41940 KB Output is correct
9 Correct 14 ms 42324 KB Output is correct
10 Correct 13 ms 42324 KB Output is correct
11 Correct 17 ms 42348 KB Output is correct
12 Correct 13 ms 42324 KB Output is correct
13 Correct 12 ms 41684 KB Output is correct
14 Correct 15 ms 41932 KB Output is correct
15 Correct 13 ms 41940 KB Output is correct
16 Correct 13 ms 41812 KB Output is correct
17 Correct 13 ms 41684 KB Output is correct
18 Correct 12 ms 41684 KB Output is correct
19 Correct 13 ms 42324 KB Output is correct
20 Correct 13 ms 42336 KB Output is correct
21 Correct 13 ms 41940 KB Output is correct
22 Correct 21 ms 44084 KB Output is correct
23 Correct 19 ms 44072 KB Output is correct
24 Correct 18 ms 44112 KB Output is correct
25 Correct 15 ms 43988 KB Output is correct
26 Correct 15 ms 43988 KB Output is correct
27 Correct 16 ms 43944 KB Output is correct
28 Correct 23 ms 43988 KB Output is correct
29 Correct 14 ms 43604 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 41812 KB Output is correct
2 Correct 13 ms 42324 KB Output is correct
3 Correct 13 ms 42324 KB Output is correct
4 Correct 13 ms 42324 KB Output is correct
5 Correct 13 ms 42324 KB Output is correct
6 Correct 17 ms 42324 KB Output is correct
7 Correct 18 ms 42324 KB Output is correct
8 Correct 16 ms 41940 KB Output is correct
9 Correct 14 ms 42324 KB Output is correct
10 Correct 13 ms 42324 KB Output is correct
11 Correct 17 ms 42348 KB Output is correct
12 Correct 13 ms 42324 KB Output is correct
13 Correct 12 ms 41684 KB Output is correct
14 Correct 15 ms 41932 KB Output is correct
15 Correct 13 ms 41940 KB Output is correct
16 Correct 13 ms 41812 KB Output is correct
17 Correct 21 ms 44084 KB Output is correct
18 Correct 19 ms 44072 KB Output is correct
19 Correct 18 ms 44112 KB Output is correct
20 Correct 15 ms 43988 KB Output is correct
21 Correct 15 ms 43988 KB Output is correct
22 Correct 16 ms 43944 KB Output is correct
23 Correct 23 ms 43988 KB Output is correct
24 Correct 14 ms 43604 KB Output is correct
25 Correct 13 ms 41684 KB Output is correct
26 Correct 12 ms 41684 KB Output is correct
27 Correct 13 ms 42324 KB Output is correct
28 Correct 13 ms 42336 KB Output is correct
29 Correct 13 ms 41940 KB Output is correct
30 Correct 35 ms 50252 KB Output is correct
31 Correct 42 ms 50124 KB Output is correct
32 Correct 31 ms 50252 KB Output is correct
33 Correct 27 ms 49364 KB Output is correct
34 Correct 33 ms 49364 KB Output is correct
35 Correct 39 ms 49364 KB Output is correct
36 Correct 39 ms 49448 KB Output is correct
37 Correct 36 ms 49356 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 41812 KB Output is correct
2 Correct 13 ms 42324 KB Output is correct
3 Correct 13 ms 42324 KB Output is correct
4 Correct 13 ms 42324 KB Output is correct
5 Correct 13 ms 42324 KB Output is correct
6 Correct 17 ms 42324 KB Output is correct
7 Correct 18 ms 42324 KB Output is correct
8 Correct 16 ms 41940 KB Output is correct
9 Correct 14 ms 42324 KB Output is correct
10 Correct 13 ms 42324 KB Output is correct
11 Correct 17 ms 42348 KB Output is correct
12 Correct 13 ms 42324 KB Output is correct
13 Correct 12 ms 41684 KB Output is correct
14 Correct 15 ms 41932 KB Output is correct
15 Correct 13 ms 41940 KB Output is correct
16 Correct 13 ms 41812 KB Output is correct
17 Correct 21 ms 44084 KB Output is correct
18 Correct 19 ms 44072 KB Output is correct
19 Correct 18 ms 44112 KB Output is correct
20 Correct 15 ms 43988 KB Output is correct
21 Correct 15 ms 43988 KB Output is correct
22 Correct 16 ms 43944 KB Output is correct
23 Correct 23 ms 43988 KB Output is correct
24 Correct 14 ms 43604 KB Output is correct
25 Correct 35 ms 50252 KB Output is correct
26 Correct 42 ms 50124 KB Output is correct
27 Correct 31 ms 50252 KB Output is correct
28 Correct 27 ms 49364 KB Output is correct
29 Correct 33 ms 49364 KB Output is correct
30 Correct 39 ms 49364 KB Output is correct
31 Correct 39 ms 49448 KB Output is correct
32 Correct 36 ms 49356 KB Output is correct
33 Correct 13 ms 41684 KB Output is correct
34 Correct 12 ms 41684 KB Output is correct
35 Correct 13 ms 42324 KB Output is correct
36 Correct 13 ms 42336 KB Output is correct
37 Correct 13 ms 41940 KB Output is correct
38 Correct 86 ms 99416 KB Output is correct
39 Correct 88 ms 99280 KB Output is correct
40 Correct 88 ms 99344 KB Output is correct
41 Correct 97 ms 99436 KB Output is correct
42 Correct 284 ms 107712 KB Output is correct
43 Correct 367 ms 107680 KB Output is correct
44 Correct 277 ms 107708 KB Output is correct
45 Correct 436 ms 104552 KB Output is correct
46 Correct 248 ms 101508 KB Output is correct
47 Correct 209 ms 101480 KB Output is correct
48 Correct 318 ms 103492 KB Output is correct
49 Correct 308 ms 103600 KB Output is correct
50 Correct 162 ms 79752 KB Output is correct
51 Correct 164 ms 72744 KB Output is correct
52 Correct 301 ms 103620 KB Output is correct
53 Correct 294 ms 103516 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 42708 KB Output is correct
2 Correct 18 ms 42580 KB Output is correct
3 Correct 18 ms 42580 KB Output is correct
4 Correct 17 ms 41812 KB Output is correct
5 Correct 19 ms 42580 KB Output is correct
6 Correct 19 ms 42708 KB Output is correct
7 Correct 21 ms 42836 KB Output is correct
8 Correct 19 ms 42752 KB Output is correct
9 Correct 18 ms 42708 KB Output is correct
10 Correct 17 ms 42324 KB Output is correct
11 Correct 18 ms 42452 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 41684 KB Output is correct
2 Correct 12 ms 41684 KB Output is correct
3 Correct 13 ms 42324 KB Output is correct
4 Correct 13 ms 42336 KB Output is correct
5 Correct 13 ms 41940 KB Output is correct
6 Correct 16 ms 41940 KB Output is correct
7 Correct 1080 ms 322704 KB Output is correct
8 Correct 2335 ms 608712 KB Output is correct
9 Correct 2368 ms 610704 KB Output is correct
10 Correct 2314 ms 610880 KB Output is correct
11 Correct 432 ms 325164 KB Output is correct
12 Correct 791 ms 576332 KB Output is correct
13 Correct 870 ms 594284 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 41812 KB Output is correct
2 Correct 13 ms 42324 KB Output is correct
3 Correct 13 ms 42324 KB Output is correct
4 Correct 13 ms 42324 KB Output is correct
5 Correct 13 ms 42324 KB Output is correct
6 Correct 17 ms 42324 KB Output is correct
7 Correct 18 ms 42324 KB Output is correct
8 Correct 16 ms 41940 KB Output is correct
9 Correct 14 ms 42324 KB Output is correct
10 Correct 13 ms 42324 KB Output is correct
11 Correct 17 ms 42348 KB Output is correct
12 Correct 13 ms 42324 KB Output is correct
13 Correct 12 ms 41684 KB Output is correct
14 Correct 15 ms 41932 KB Output is correct
15 Correct 13 ms 41940 KB Output is correct
16 Correct 13 ms 41812 KB Output is correct
17 Correct 21 ms 44084 KB Output is correct
18 Correct 19 ms 44072 KB Output is correct
19 Correct 18 ms 44112 KB Output is correct
20 Correct 15 ms 43988 KB Output is correct
21 Correct 15 ms 43988 KB Output is correct
22 Correct 16 ms 43944 KB Output is correct
23 Correct 23 ms 43988 KB Output is correct
24 Correct 14 ms 43604 KB Output is correct
25 Correct 35 ms 50252 KB Output is correct
26 Correct 42 ms 50124 KB Output is correct
27 Correct 31 ms 50252 KB Output is correct
28 Correct 27 ms 49364 KB Output is correct
29 Correct 33 ms 49364 KB Output is correct
30 Correct 39 ms 49364 KB Output is correct
31 Correct 39 ms 49448 KB Output is correct
32 Correct 36 ms 49356 KB Output is correct
33 Correct 86 ms 99416 KB Output is correct
34 Correct 88 ms 99280 KB Output is correct
35 Correct 88 ms 99344 KB Output is correct
36 Correct 97 ms 99436 KB Output is correct
37 Correct 284 ms 107712 KB Output is correct
38 Correct 367 ms 107680 KB Output is correct
39 Correct 277 ms 107708 KB Output is correct
40 Correct 436 ms 104552 KB Output is correct
41 Correct 248 ms 101508 KB Output is correct
42 Correct 209 ms 101480 KB Output is correct
43 Correct 318 ms 103492 KB Output is correct
44 Correct 308 ms 103600 KB Output is correct
45 Correct 162 ms 79752 KB Output is correct
46 Correct 164 ms 72744 KB Output is correct
47 Correct 301 ms 103620 KB Output is correct
48 Correct 294 ms 103516 KB Output is correct
49 Correct 19 ms 42708 KB Output is correct
50 Correct 18 ms 42580 KB Output is correct
51 Correct 18 ms 42580 KB Output is correct
52 Correct 17 ms 41812 KB Output is correct
53 Correct 19 ms 42580 KB Output is correct
54 Correct 19 ms 42708 KB Output is correct
55 Correct 21 ms 42836 KB Output is correct
56 Correct 19 ms 42752 KB Output is correct
57 Correct 18 ms 42708 KB Output is correct
58 Correct 17 ms 42324 KB Output is correct
59 Correct 18 ms 42452 KB Output is correct
60 Correct 16 ms 41940 KB Output is correct
61 Correct 1080 ms 322704 KB Output is correct
62 Correct 2335 ms 608712 KB Output is correct
63 Correct 2368 ms 610704 KB Output is correct
64 Correct 2314 ms 610880 KB Output is correct
65 Correct 432 ms 325164 KB Output is correct
66 Correct 791 ms 576332 KB Output is correct
67 Correct 870 ms 594284 KB Output is correct
68 Correct 13 ms 41684 KB Output is correct
69 Correct 12 ms 41684 KB Output is correct
70 Correct 13 ms 42324 KB Output is correct
71 Correct 13 ms 42336 KB Output is correct
72 Correct 13 ms 41940 KB Output is correct
73 Correct 977 ms 594424 KB Output is correct
74 Correct 1020 ms 594252 KB Output is correct
75 Correct 959 ms 594360 KB Output is correct
76 Correct 1020 ms 594316 KB Output is correct
77 Correct 4381 ms 725768 KB Output is correct
78 Correct 2574 ms 415864 KB Output is correct
79 Correct 2710 ms 483092 KB Output is correct
80 Correct 4405 ms 682844 KB Output is correct
81 Correct 2814 ms 430872 KB Output is correct
82 Correct 3530 ms 547844 KB Output is correct
83 Correct 4558 ms 707952 KB Output is correct
84 Correct 2445 ms 423528 KB Output is correct
85 Correct 4372 ms 708008 KB Output is correct
86 Correct 4255 ms 695548 KB Output is correct
87 Correct 2600 ms 512368 KB Output is correct
88 Correct 4778 ms 772604 KB Output is correct
89 Correct 4503 ms 773540 KB Output is correct
90 Correct 4387 ms 773628 KB Output is correct