oj.uz

Submission #1008796

# Submission time Handle Problem Language Result Execution time Memory
1008796 2024-06-26T18:39:14 Z PagodePaiva Rectangles (IOI19_rect) C++17
100 / 100
 4621 ms 1048576 KB 
#include "rect.h"
#include <bits/stdc++.h>
#define int int16_t

using namespace std;

const int N = 2510;
const int inf = N;
const int LOGN = 12;

int32_t v[N][N];
int p1[N][N];
int p2[N][N];
int p3[N][N];
int p4[N][N];
int lg2[N];

int logg2(int x){
	return lg2[x];
}

struct RMQmin{
	int val[N][LOGN];
	int n;
	void build(vector <int> v){
		for(int i = 0;i < N;i++){
			for(int j = 0;j < LOGN;j++){
				val[i][j] = inf;
			}
		}
		n = v.size();
		for(int i = 1;i <= n;i++){
			val[i][0] = v[i-1];
		}
		for(int j = 1;j < LOGN;j++){
			for(int i = 1;i <= n;i++){
				if((i+(1<< (j-1))) > n) val[i][j] = val[i][j-1];
				else val[i][j] = min(val[i][j-1], val[(i+(1 << (j-1)))][j-1]);
			}
		}
		return;
	}
	int query(int l, int r){
		int t = logg2(r-l+1);
		return min(val[l][t], val[(r-(1<<t)+1)][t]);
	}
} seg1[N], seg3[N];

struct RMQmax{
	int val[N][LOGN];
	int n;
	void build(vector <int> v){
		for(int i = 0;i < N;i++){
			for(int j = 0;j < LOGN;j++){
				val[i][j] = 0;
			}
		}
		n = v.size();
		for(int i = 1;i <= n;i++){
			val[i][0] = v[i-1];
		}
		for(int j = 1;j < LOGN;j++){
			for(int i = 1;i <= n;i++){
				if((i+(1<< (j-1))) > n) val[i][j] = val[i][j-1];
				else val[i][j] = max(val[i][j-1], val[(i+(1 << (j-1)))][j-1]);
			}
		}
		return;
	}
	int query(int l, int r){
		int t = logg2(r-l+1);
		return max(val[l][t], val[(r-(1<<t)+1)][t]);
	}
} seg2[N], seg4[N];

set <array <int, 4>> s;
int n, m;

bool check(int r1, int c1, int r2, int c2){
	if(r1 == 0 or r2 == n+1 or r2-r1 <= 1) return false;
	if(c1 == 0 or c2 == m+1 or c2-c1 <= 1) return false;
	if(r1+1 > r2-1 or c1+1 > c2-1) return false;
	if(c1 <= 0 or c1 > m or c2 <= 0 or c2 > m or r1 <= 0 or r1 > n or r2 <= 0 or r2 > n) return false;
	int x1 = seg1[c1].query(r1+1, r2-1);
	if(c1+1 <= x1 and x1 <= c2-1) return false;
	x1 = seg2[c2].query(r1+1, r2-1);
	if(c1 < x1 and x1 < c2) return false;
	int x2 = seg3[r1].query(c1+1, c2-1);
	if(r1 < x2 and x2 < r2) return false;
	x2 = seg4[r2].query(c1+1, c2-1);
	if(r1 < x2 and x2 < r2) return false;
	if(s.find({r1, c1, r2, c2}) != s.end()) return false;
	s.insert({r1, c1, r2, c2});
	return true;
}
long long count_rectangles(std::vector<std::vector<int32_t> > a) {
	lg2[0] = 0;
	lg2[1] = 0;
	for(int i = 2;i < N;i++){
		int t = i/2;
		lg2[i] = lg2[t]+1;
	}
	n = a.size(), m = a[0].size();
	s.clear();
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			v[i][j] = a[i-1][j-1];
		}
	}
	for(int i = 1;i <= n;i++){
		stack <int> s;
		for(int j = 1;j <= m;j++){
			if(s.empty()) s.push(j);
			else{
				while(!s.empty()){
					int t = s.top();
					if(v[i][j] >= v[i][t]){
						p1[i][t] = j;
						s.pop();
					}
					else{
						break;
					}
				}
				s.push(j);
			}
		}
		while(!s.empty()){
			int t = s.top();
			p1[i][t] = m+1;
			s.pop();
		}
	}
	for(int i = 1;i <= n;i++){
		stack <int> s;
		for(int j = m;j > 0;j--){
			if(s.empty()) s.push(j);
			else{
				while(!s.empty()){
					int t = s.top();
					if(v[i][j] >= v[i][t]){
						p2[i][t] = j;
						s.pop();
					}
					else{
						break;
					}
				}
				s.push(j);
			}
		}
		while(!s.empty()){
			int t = s.top();
			p2[i][t] = 0;
			s.pop();
		}
	}
	for(int j = 1;j <= m;j++){
		stack <int> s;
		for(int i = 1;i <= n;i++){
			if(s.empty()) s.push(i);
			else{
				while(!s.empty()){
					int t = s.top();
					if(v[i][j] >= v[t][j]){
						p3[t][j] = i;
						s.pop();
					}
					else{
						break;
					}
				}
				s.push(i);
			}
		}
		while(!s.empty()){
			int t = s.top();
			p3[t][j] = n+1;
			s.pop();
		}
	}
	for(int j = 1;j <= m;j++){
		stack <int> s;
		for(int i = n;i > 0;i--){
			if(s.empty()) s.push(i);
			else{
				while(!s.empty()){
					int t = s.top();
					if(v[i][j] >= v[t][j]){
						p4[t][j] = i;
						s.pop();
					}
					else{
						break;
					}
				}
				s.push(i);
			}
		}
		while(!s.empty()){
			int t = s.top();
			p4[t][j] = 0;
			s.pop();
		}
	}
	for(int i = 1;i <= n;i++){
		vector <int> aux1, aux2;
		for(int j = 1;j <= m;j++){
			aux1.push_back(p3[i][j]);
			aux2.push_back(p4[i][j]);
		}
		seg3[i].build(aux1);
		seg4[i].build(aux2);
	}
	for(int j = 1;j <= m;j++){
		vector <int> aux1, aux2;
		for(int i = 1;i <= n;i++){
			aux1.push_back(p1[i][j]);
			aux2.push_back(p2[i][j]);
		}
		seg1[j].build(aux1);
		seg2[j].build(aux2);
	}
	for(int r1 = 1;r1 < n;r1++){
		for(int c1 = 1;c1 < m;c1++){
			int r2 = p3[r1][c1+1];
			int c2 = (1 <= r1+1 and r1+1 <= r2-1 and r2-1 <= n ? seg1[c1].query(r1+1, r2-1) : -1);
			check(r1, c1, r2, c2);
			c2 = p1[r1+1][c1];
			r2 = (1 <= c1+1 and c1+1 <= c2-1 and c2-1 <= m ? seg3[r1].query(c1+1, c2-1) : -1);
			check(r1, c1, r2, c2);
		}
	}
	for(int r1 = 1;r1 < n;r1++){
		for(int c2 = m;c2 > 1;c2--){
			int c1 = p2[r1+1][c2];
			int r2 = (1 <= c1+1 and c1+1 <= c2-1 and c2-1 <= m ? seg3[r1].query(c1+1, c2-1) : -1);
			check(r1, c1, r2, c2);
			r2 = p3[r1][c2-1];
			c1 = (1 <= r1+1 and r1+1 <= r2-1 and r2-1 <= n ? seg2[c2].query(r1+1, r2-1) : -1);
			check(r1, c1, r2, c2);
		}
	}
	for(int r2 = n;r2 > 1;r2--){
		for(int c1 = 1;c1 < m;c1++){
			int r1 = p4[r2][c1+1];
			int c2 = (1 <= r1+1 and r1+1 <= r2-1 and r2-1 <= n ? seg1[c1].query(r1+1, r2-1) : -1);
			check(r1, c1, r2, c2);
			c2 = p1[r2-1][c1];
			r1 = (1 <= c1+1 and c1+1 <= c2-1 and c2-1 <= m ? seg4[r2].query(c1+1, c2-1) : -1);
			check(r1, c1, r2, c2);
			/*
			int c2 = p1[r2-1][c1];
			int r1 = p4[r2][c1+1];
			check(r1, c1, r2, c2);
			*/
		}
	}
	for(int r2 = n;r2 > 1;r2--){
		for(int c2 = m;c2 > 1;c2--){
			int c1 = p2[r2-1][c2];
			int r1 = (1 <= c1+1 and c1+1 <= c2-1 and c2-1 <= m ? seg4[r2].query(c1+1, c2-1) : -1);
			check(r1, c1, r2, c2);
			r1 = p4[r2][c2-1];
			c1 = (1 <= r1+1 and r1+1 <= r2-1 and r2-1 <= n ? seg2[c2].query(r1+1, r2-1) : -1);
			check(r1, c1, r2, c2);
			/*
			int c1 = p2[r2-1][c2];
			int r1 = p4[r2][c2-1];
			check(r1, c1, r2, c2);
			*/
		}
	}
	long long res = s.size();
	return res;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 4 ms 8024 KB Output is correct
3 Correct 4 ms 8028 KB Output is correct
4 Correct 4 ms 8028 KB Output is correct
5 Correct 3 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 4 ms 5468 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 4 ms 8028 KB Output is correct
11 Correct 4 ms 8280 KB Output is correct
12 Correct 4 ms 8028 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 0 ms 1116 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 3 ms 8024 KB Output is correct
20 Correct 3 ms 6232 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 4 ms 8024 KB Output is correct
3 Correct 4 ms 8028 KB Output is correct
4 Correct 4 ms 8028 KB Output is correct
5 Correct 3 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 4 ms 5468 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 4 ms 8028 KB Output is correct
11 Correct 4 ms 8280 KB Output is correct
12 Correct 4 ms 8028 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 0 ms 1116 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 3 ms 8024 KB Output is correct
20 Correct 3 ms 6232 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 12 ms 21336 KB Output is correct
23 Correct 10 ms 21340 KB Output is correct
24 Correct 13 ms 21340 KB Output is correct
25 Correct 13 ms 21084 KB Output is correct
26 Correct 10 ms 20828 KB Output is correct
27 Correct 10 ms 20996 KB Output is correct
28 Correct 10 ms 21084 KB Output is correct
29 Correct 7 ms 16220 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 4 ms 8024 KB Output is correct
3 Correct 4 ms 8028 KB Output is correct
4 Correct 4 ms 8028 KB Output is correct
5 Correct 3 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 4 ms 5468 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 4 ms 8028 KB Output is correct
11 Correct 4 ms 8280 KB Output is correct
12 Correct 4 ms 8028 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 0 ms 1116 KB Output is correct
17 Correct 12 ms 21336 KB Output is correct
18 Correct 10 ms 21340 KB Output is correct
19 Correct 13 ms 21340 KB Output is correct
20 Correct 13 ms 21084 KB Output is correct
21 Correct 10 ms 20828 KB Output is correct
22 Correct 10 ms 20996 KB Output is correct
23 Correct 10 ms 21084 KB Output is correct
24 Correct 7 ms 16220 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 3 ms 8024 KB Output is correct
28 Correct 3 ms 6232 KB Output is correct
29 Correct 1 ms 1884 KB Output is correct
30 Correct 39 ms 54364 KB Output is correct
31 Correct 38 ms 54324 KB Output is correct
32 Correct 44 ms 54356 KB Output is correct
33 Correct 30 ms 52572 KB Output is correct
34 Correct 34 ms 53064 KB Output is correct
35 Correct 38 ms 53128 KB Output is correct
36 Correct 36 ms 53316 KB Output is correct
37 Correct 37 ms 52756 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 4 ms 8024 KB Output is correct
3 Correct 4 ms 8028 KB Output is correct
4 Correct 4 ms 8028 KB Output is correct
5 Correct 3 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 4 ms 5468 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 4 ms 8028 KB Output is correct
11 Correct 4 ms 8280 KB Output is correct
12 Correct 4 ms 8028 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 0 ms 1116 KB Output is correct
17 Correct 12 ms 21336 KB Output is correct
18 Correct 10 ms 21340 KB Output is correct
19 Correct 13 ms 21340 KB Output is correct
20 Correct 13 ms 21084 KB Output is correct
21 Correct 10 ms 20828 KB Output is correct
22 Correct 10 ms 20996 KB Output is correct
23 Correct 10 ms 21084 KB Output is correct
24 Correct 7 ms 16220 KB Output is correct
25 Correct 39 ms 54364 KB Output is correct
26 Correct 38 ms 54324 KB Output is correct
27 Correct 44 ms 54356 KB Output is correct
28 Correct 30 ms 52572 KB Output is correct
29 Correct 34 ms 53064 KB Output is correct
30 Correct 38 ms 53128 KB Output is correct
31 Correct 36 ms 53316 KB Output is correct
32 Correct 37 ms 52756 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 3 ms 8024 KB Output is correct
36 Correct 3 ms 6232 KB Output is correct
37 Correct 1 ms 1884 KB Output is correct
38 Correct 153 ms 191060 KB Output is correct
39 Correct 150 ms 190984 KB Output is correct
40 Correct 165 ms 191060 KB Output is correct
41 Correct 150 ms 191060 KB Output is correct
42 Correct 341 ms 213840 KB Output is correct
43 Correct 364 ms 213684 KB Output is correct
44 Correct 379 ms 214196 KB Output is correct
45 Correct 325 ms 205740 KB Output is correct
46 Correct 199 ms 189800 KB Output is correct
47 Correct 219 ms 191060 KB Output is correct
48 Correct 310 ms 197456 KB Output is correct
49 Correct 316 ms 199252 KB Output is correct
50 Correct 155 ms 148908 KB Output is correct
51 Correct 153 ms 141136 KB Output is correct
52 Correct 285 ms 198276 KB Output is correct
53 Correct 307 ms 199220 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 295760 KB Output is correct
2 Correct 105 ms 251216 KB Output is correct
3 Correct 120 ms 295504 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 118 ms 295532 KB Output is correct
6 Correct 115 ms 295504 KB Output is correct
7 Correct 120 ms 295508 KB Output is correct
8 Correct 119 ms 295548 KB Output is correct
9 Correct 119 ms 295596 KB Output is correct
10 Correct 116 ms 295248 KB Output is correct
11 Correct 120 ms 295400 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 3 ms 8024 KB Output is correct
4 Correct 3 ms 6232 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1065 ms 483868 KB Output is correct
8 Correct 2172 ms 734476 KB Output is correct
9 Correct 2241 ms 736632 KB Output is correct
10 Correct 2212 ms 736736 KB Output is correct
11 Correct 493 ms 507220 KB Output is correct
12 Correct 889 ms 702728 KB Output is correct
13 Correct 895 ms 724888 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 4 ms 8024 KB Output is correct
3 Correct 4 ms 8028 KB Output is correct
4 Correct 4 ms 8028 KB Output is correct
5 Correct 3 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 3 ms 5980 KB Output is correct
8 Correct 4 ms 5468 KB Output is correct
9 Correct 3 ms 8028 KB Output is correct
10 Correct 4 ms 8028 KB Output is correct
11 Correct 4 ms 8280 KB Output is correct
12 Correct 4 ms 8028 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 0 ms 1116 KB Output is correct
17 Correct 12 ms 21336 KB Output is correct
18 Correct 10 ms 21340 KB Output is correct
19 Correct 13 ms 21340 KB Output is correct
20 Correct 13 ms 21084 KB Output is correct
21 Correct 10 ms 20828 KB Output is correct
22 Correct 10 ms 20996 KB Output is correct
23 Correct 10 ms 21084 KB Output is correct
24 Correct 7 ms 16220 KB Output is correct
25 Correct 39 ms 54364 KB Output is correct
26 Correct 38 ms 54324 KB Output is correct
27 Correct 44 ms 54356 KB Output is correct
28 Correct 30 ms 52572 KB Output is correct
29 Correct 34 ms 53064 KB Output is correct
30 Correct 38 ms 53128 KB Output is correct
31 Correct 36 ms 53316 KB Output is correct
32 Correct 37 ms 52756 KB Output is correct
33 Correct 153 ms 191060 KB Output is correct
34 Correct 150 ms 190984 KB Output is correct
35 Correct 165 ms 191060 KB Output is correct
36 Correct 150 ms 191060 KB Output is correct
37 Correct 341 ms 213840 KB Output is correct
38 Correct 364 ms 213684 KB Output is correct
39 Correct 379 ms 214196 KB Output is correct
40 Correct 325 ms 205740 KB Output is correct
41 Correct 199 ms 189800 KB Output is correct
42 Correct 219 ms 191060 KB Output is correct
43 Correct 310 ms 197456 KB Output is correct
44 Correct 316 ms 199252 KB Output is correct
45 Correct 155 ms 148908 KB Output is correct
46 Correct 153 ms 141136 KB Output is correct
47 Correct 285 ms 198276 KB Output is correct
48 Correct 307 ms 199220 KB Output is correct
49 Correct 121 ms 295760 KB Output is correct
50 Correct 105 ms 251216 KB Output is correct
51 Correct 120 ms 295504 KB Output is correct
52 Correct 1 ms 860 KB Output is correct
53 Correct 118 ms 295532 KB Output is correct
54 Correct 115 ms 295504 KB Output is correct
55 Correct 120 ms 295508 KB Output is correct
56 Correct 119 ms 295548 KB Output is correct
57 Correct 119 ms 295596 KB Output is correct
58 Correct 116 ms 295248 KB Output is correct
59 Correct 120 ms 295400 KB Output is correct
60 Correct 1 ms 2908 KB Output is correct
61 Correct 1065 ms 483868 KB Output is correct
62 Correct 2172 ms 734476 KB Output is correct
63 Correct 2241 ms 736632 KB Output is correct
64 Correct 2212 ms 736736 KB Output is correct
65 Correct 493 ms 507220 KB Output is correct
66 Correct 889 ms 702728 KB Output is correct
67 Correct 895 ms 724888 KB Output is correct
68 Correct 0 ms 604 KB Output is correct
69 Correct 1 ms 1116 KB Output is correct
70 Correct 3 ms 8024 KB Output is correct
71 Correct 3 ms 6232 KB Output is correct
72 Correct 1 ms 1884 KB Output is correct
73 Correct 1503 ms 759280 KB Output is correct
74 Correct 1497 ms 759296 KB Output is correct
75 Correct 1345 ms 759300 KB Output is correct
76 Correct 1354 ms 759424 KB Output is correct
77 Correct 4545 ms 1048576 KB Output is correct
78 Correct 2112 ms 619036 KB Output is correct
79 Correct 2379 ms 671444 KB Output is correct
80 Correct 3643 ms 835136 KB Output is correct
81 Correct 2466 ms 634704 KB Output is correct
82 Correct 2930 ms 762680 KB Output is correct
83 Correct 3487 ms 861268 KB Output is correct
84 Correct 1988 ms 627040 KB Output is correct
85 Correct 3518 ms 860652 KB Output is correct
86 Correct 3392 ms 845116 KB Output is correct
87 Correct 2753 ms 779712 KB Output is correct
88 Correct 4621 ms 1048576 KB Output is correct
89 Correct 4453 ms 1048576 KB Output is correct
90 Correct 4238 ms 1048576 KB Output is correct