oj.uz

Submission #1064760

# Submission time Handle Problem Language Result Execution time Memory
1064760 2024-08-18T17:28:41 Z jamjanek Rectangles (IOI19_rect) C++14
100 / 100
 3654 ms 716392 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>>stosy[2510];
int nast[2510][2510][4];
int nast2[2510][2510][4];

const int base = 1<<12;
int tree1[2510][2*base];
int tree2[2510][2*base];
int tree3[2*base][2510];
int tree4[2*base][2510];

int MAXI1(int w, int l, int p, int a, int b, int war){
	if(p<a || b<l)return -1;
	if(a<=l && p<=b)return tree3[w][war];
	return max(MAXI1(w*2, l, (l+p)/2, a, b, war), MAXI1(w*2+1, (l+p)/2+1, p, a, b, war));
}
int MINI1(int w, int l, int p, int a, int b, int war){
	if(p<a || b<l)return 2600;
	if(a<=l && p<=b)return tree4[w][war];
	return min(MINI1(w*2, l, (l+p)/2, a, b, war), MINI1(w*2+1, (l+p)/2+1, p, a, b, war));
}
int MAXI2(int w, int l, int p, int a, int b, int war){
	if(p<a || b<l)return -1;
	if(a<=l && p<=b)return tree1[war][w];
	return max(MAXI2(w*2, l, (l+p)/2, a, b, war), MAXI2(w*2+1, (l+p)/2+1, p, a, b, war));
}
int MINI2(int w, int l, int p, int a, int b, int war){
	if(p<a || b<l)return 2600;
	if(a<=l && p<=b)return tree2[war][w];
	return min(MINI2(w*2, l, (l+p)/2, a, b, war), MINI2(w*2+1, (l+p)/2+1, p, a, b, war));
}

int maxi1(int war, int l, int r){
//	printf("%d %d %d  ", war, l, r);
	l+=base, r+=base;
	if(l>r)return -1;
	int res = max(tree3[l][war], tree3[r][war]);
	while(l/2<r/2){
		if((l&1)==0){
			res = max(res, tree3[l^1][war]);
		}
		if(r&1){
			res = max(res, tree3[r^1][war]);
		}
		l>>=1;
		r>>=1;
	}
//	printf("%d\n", res);
	return res;
	return MAXI1(1, 0, base-1, l, r, war);
	for(int i=l;i<=r;i++)
		res = max(res, nast2[i][war][0]);
	return res;
}
int mini1(int war, int l, int r){
	l+=base, r+=base;
	if(l>r)return 2600;
	int res = min(tree4[l][war], tree4[r][war]);
	while(l/2<r/2){
		if((l&1)==0){
			res = min(res, tree4[l^1][war]);
		}
		if(r&1){
			res = min(res, tree4[r^1][war]);
		}
		l>>=1;
		r>>=1;
	}
//	printf("%d\n", res);
	return res;

	return MINI1(1, 0, base-1, l, r, war);
//	int res = 2600;
	for(int i=l;i<=r;i++)
		res = min(res, nast2[i][war][1]);
	return res;
}
int maxi2(int war, int l, int r){
	l+=base, r+=base;
	if(l>r)return -1;
	int res = max(tree1[war][l], tree1[war][r]);
	while(l/2<r/2){
		if((l&1)==0){
			res = max(res, tree1[war][l^1]);
		}
		if(r&1){
			res = max(res, tree1[war][r^1]);
		}
		l>>=1;
		r>>=1;
	}
//	printf("%d\n", res);
	return res;
	
	return MAXI2(1, 0, base-1, l, r, war);
//	int res = -1;
	for(int i=l;i<=r;i++)
		res = max(res, nast2[war][i][2]);
	return res;
}
int mini2(int war, int l, int r){
	return MINI2(1, 0, base-1, l, r, war);
	int res = 2600;
	for(int i=l;i<=r;i++)
		res = min(res, nast2[war][i][3]);
	return res;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	int n = a.size();
	int m = a[0].size();
	int i, j;

	//poprzednie po x [0]	
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			while(stosy[i].size() && stosy[i].back().first<=a[i][j])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast[i][j][0] = stosy[i].back().second;
			else
				nast[i][j][0] = -1;
			stosy[i].push_back({a[i][j], j});
		}
	}
	for(i=0;i<n;i++)
		stosy[i].clear();

	//nastepne po x [1]

	for(i=0;i<n;i++){
		for(j=m-1;j>=0;j--){
			while(stosy[i].size() && stosy[i].back().first<=a[i][j])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast[i][j][1] = stosy[i].back().second;
			else
				nast[i][j][1] = m;
			stosy[i].push_back({a[i][j], j});
		}
	}
	for(i=0;i<n;i++)
		stosy[i].clear();
	
	//poprzednie po y [2]
	for(i=0;i<m;i++){
		for(j=0;j<n;j++){
			while(stosy[i].size() && stosy[i].back().first<=a[j][i])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast[j][i][2] = stosy[i].back().second;
			else
				nast[j][i][2] = -1;
			stosy[i].push_back({a[j][i], j});
		}
	}
	for(i=0;i<m;i++)
		stosy[i].clear();

	//nastepne po y [3]
	for(i=0;i<m;i++){
		for(j = n-1;j>=0;j--){
			while(stosy[i].size() && stosy[i].back().first<=a[j][i])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast[j][i][3] = stosy[i].back().second;
			else
				nast[j][i][3] = n;
			stosy[i].push_back({a[j][i], j});
		}
	}
	for(i=0;i<m;i++)
		stosy[i].clear();
		
		
		
		
		
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			while(stosy[i].size() && stosy[i].back().first<a[i][j])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast2[i][j][0] = stosy[i].back().second;
			else
				nast2[i][j][0] = -1;
			stosy[i].push_back({a[i][j], j});
		}
	}
	for(i=0;i<n;i++)
		stosy[i].clear();

	//nastepne po x [1]

	for(i=0;i<n;i++){
		for(j=m-1;j>=0;j--){
			while(stosy[i].size() && stosy[i].back().first<a[i][j])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast2[i][j][1] = stosy[i].back().second;
			else
				nast2[i][j][1] = m;
			stosy[i].push_back({a[i][j], j});
		}
	}
	for(i=0;i<n;i++)
		stosy[i].clear();
	
	//poprzednie po y [2]
	for(i=0;i<m;i++){
		for(j=0;j<n;j++){
			while(stosy[i].size() && stosy[i].back().first<a[j][i])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast2[j][i][2] = stosy[i].back().second;
			else
				nast2[j][i][2] = -1;
			stosy[i].push_back({a[j][i], j});
		}
	}
	for(i=0;i<m;i++)
		stosy[i].clear();

	//nastepne po y [3]
	for(i=0;i<m;i++){
		for(j = n-1;j>=0;j--){
			while(stosy[i].size() && stosy[i].back().first<a[j][i])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast2[j][i][3] = stosy[i].back().second;
			else
				nast2[j][i][3] = n;
			stosy[i].push_back({a[j][i], j});
		}
	}
	for(i=0;i<m;i++)
		stosy[i].clear();



	vector<pair<pair<int,int>, pair<int,int>>>sett;
	for(i=1;i<n-1;i++)
		for(j=1;j<m-1;j++){
			//printf("%d %d %d %d\n", nast[i][j][0], nast[i][j][1], nast[i][j][2], nast[i][j][3]);
			if(nast[i][j][0]!=-1 && nast[i][j][1]!=m && nast[i][j][2]!=-1 && nast[i][j][3]!=n){
				//printf("dodaje\n");
				sett.push_back({{nast[i][j][0], nast[i][j][1]}, {nast[i][j][2], nast[i][j][3]}});
			}
		}
	
	for(i=0;i<n;i++)
		for(j=0;j<m;j++){
			tree3[base+i][j] = nast2[i][j][0];
			tree4[base+i][j] = nast2[i][j][1];
			tree1[i][base+j] = nast2[i][j][2];
			tree2[i][base+j] = nast2[i][j][3];
		}
	for(i=0;i<n;i++)
		for(j=base-1;j>0;j--){
			tree1[i][j] = max(tree1[i][j*2], tree1[i][j*2+1]);
			tree2[i][j] = min(tree2[i][j*2], tree2[i][j*2+1]);
		}
	for(i=0;i<m;i++)
		for(j=base-1;j>0;j--){
			tree3[j][i] = max(tree3[j*2][i], tree3[j*2+1][i]);
			tree4[j][i] = min(tree4[j*2][i], tree4[j*2+1][i]);
		}
	sort(sett.begin(), sett.end());
	long long wynik = 0;
	for(i=0;i<(int)sett.size();i++){
		if(i!=0 && sett[i-1]==sett[i])continue;
		auto x = sett[i];
		if(mini1(x.first.first, x.second.first+1, x.second.second-1)<x.first.second)continue;
		if(maxi1(x.first.second, x.second.first+1, x.second.second-1)>x.first.first)continue;

		if(mini2(x.second.first, x.first.first+1, x.first.second-1)<x.second.second)continue;
		if(maxi2(x.second.second, x.first.first+1, x.first.second-1)>x.second.first)continue;
		wynik++;
	}
	
	return wynik;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 33884 KB Output is correct
2 Correct 14 ms 36188 KB Output is correct
3 Correct 16 ms 36440 KB Output is correct
4 Correct 21 ms 36184 KB Output is correct
5 Correct 13 ms 36188 KB Output is correct
6 Correct 15 ms 38144 KB Output is correct
7 Correct 18 ms 37464 KB Output is correct
8 Correct 20 ms 36952 KB Output is correct
9 Correct 16 ms 38236 KB Output is correct
10 Correct 15 ms 38236 KB Output is correct
11 Correct 13 ms 38184 KB Output is correct
12 Correct 14 ms 38236 KB Output is correct
13 Correct 11 ms 35544 KB Output is correct
14 Correct 15 ms 36128 KB Output is correct
15 Correct 11 ms 36188 KB Output is correct
16 Correct 11 ms 35672 KB Output is correct
17 Correct 11 ms 35672 KB Output is correct
18 Correct 12 ms 35696 KB Output is correct
19 Correct 16 ms 38236 KB Output is correct
20 Correct 14 ms 37724 KB Output is correct
21 Correct 12 ms 35932 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 33884 KB Output is correct
2 Correct 14 ms 36188 KB Output is correct
3 Correct 16 ms 36440 KB Output is correct
4 Correct 21 ms 36184 KB Output is correct
5 Correct 13 ms 36188 KB Output is correct
6 Correct 15 ms 38144 KB Output is correct
7 Correct 18 ms 37464 KB Output is correct
8 Correct 20 ms 36952 KB Output is correct
9 Correct 16 ms 38236 KB Output is correct
10 Correct 15 ms 38236 KB Output is correct
11 Correct 13 ms 38184 KB Output is correct
12 Correct 14 ms 38236 KB Output is correct
13 Correct 11 ms 35544 KB Output is correct
14 Correct 15 ms 36128 KB Output is correct
15 Correct 11 ms 36188 KB Output is correct
16 Correct 11 ms 35672 KB Output is correct
17 Correct 11 ms 35672 KB Output is correct
18 Correct 12 ms 35696 KB Output is correct
19 Correct 16 ms 38236 KB Output is correct
20 Correct 14 ms 37724 KB Output is correct
21 Correct 12 ms 35932 KB Output is correct
22 Correct 23 ms 43100 KB Output is correct
23 Correct 20 ms 43088 KB Output is correct
24 Correct 23 ms 43092 KB Output is correct
25 Correct 22 ms 42840 KB Output is correct
26 Correct 20 ms 42844 KB Output is correct
27 Correct 20 ms 42844 KB Output is correct
28 Correct 22 ms 43100 KB Output is correct
29 Correct 19 ms 65112 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 33884 KB Output is correct
2 Correct 14 ms 36188 KB Output is correct
3 Correct 16 ms 36440 KB Output is correct
4 Correct 21 ms 36184 KB Output is correct
5 Correct 13 ms 36188 KB Output is correct
6 Correct 15 ms 38144 KB Output is correct
7 Correct 18 ms 37464 KB Output is correct
8 Correct 20 ms 36952 KB Output is correct
9 Correct 16 ms 38236 KB Output is correct
10 Correct 15 ms 38236 KB Output is correct
11 Correct 13 ms 38184 KB Output is correct
12 Correct 14 ms 38236 KB Output is correct
13 Correct 11 ms 35544 KB Output is correct
14 Correct 15 ms 36128 KB Output is correct
15 Correct 11 ms 36188 KB Output is correct
16 Correct 11 ms 35672 KB Output is correct
17 Correct 23 ms 43100 KB Output is correct
18 Correct 20 ms 43088 KB Output is correct
19 Correct 23 ms 43092 KB Output is correct
20 Correct 22 ms 42840 KB Output is correct
21 Correct 20 ms 42844 KB Output is correct
22 Correct 20 ms 42844 KB Output is correct
23 Correct 22 ms 43100 KB Output is correct
24 Correct 19 ms 65112 KB Output is correct
25 Correct 11 ms 35672 KB Output is correct
26 Correct 12 ms 35696 KB Output is correct
27 Correct 16 ms 38236 KB Output is correct
28 Correct 14 ms 37724 KB Output is correct
29 Correct 12 ms 35932 KB Output is correct
30 Correct 46 ms 82488 KB Output is correct
31 Correct 43 ms 82632 KB Output is correct
32 Correct 51 ms 53960 KB Output is correct
33 Correct 39 ms 53736 KB Output is correct
34 Correct 63 ms 53704 KB Output is correct
35 Correct 42 ms 53704 KB Output is correct
36 Correct 41 ms 53632 KB Output is correct
37 Correct 41 ms 53424 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 33884 KB Output is correct
2 Correct 14 ms 36188 KB Output is correct
3 Correct 16 ms 36440 KB Output is correct
4 Correct 21 ms 36184 KB Output is correct
5 Correct 13 ms 36188 KB Output is correct
6 Correct 15 ms 38144 KB Output is correct
7 Correct 18 ms 37464 KB Output is correct
8 Correct 20 ms 36952 KB Output is correct
9 Correct 16 ms 38236 KB Output is correct
10 Correct 15 ms 38236 KB Output is correct
11 Correct 13 ms 38184 KB Output is correct
12 Correct 14 ms 38236 KB Output is correct
13 Correct 11 ms 35544 KB Output is correct
14 Correct 15 ms 36128 KB Output is correct
15 Correct 11 ms 36188 KB Output is correct
16 Correct 11 ms 35672 KB Output is correct
17 Correct 23 ms 43100 KB Output is correct
18 Correct 20 ms 43088 KB Output is correct
19 Correct 23 ms 43092 KB Output is correct
20 Correct 22 ms 42840 KB Output is correct
21 Correct 20 ms 42844 KB Output is correct
22 Correct 20 ms 42844 KB Output is correct
23 Correct 22 ms 43100 KB Output is correct
24 Correct 19 ms 65112 KB Output is correct
25 Correct 46 ms 82488 KB Output is correct
26 Correct 43 ms 82632 KB Output is correct
27 Correct 51 ms 53960 KB Output is correct
28 Correct 39 ms 53736 KB Output is correct
29 Correct 63 ms 53704 KB Output is correct
30 Correct 42 ms 53704 KB Output is correct
31 Correct 41 ms 53632 KB Output is correct
32 Correct 41 ms 53424 KB Output is correct
33 Correct 11 ms 35672 KB Output is correct
34 Correct 12 ms 35696 KB Output is correct
35 Correct 16 ms 38236 KB Output is correct
36 Correct 14 ms 37724 KB Output is correct
37 Correct 12 ms 35932 KB Output is correct
38 Correct 132 ms 128044 KB Output is correct
39 Correct 157 ms 128080 KB Output is correct
40 Correct 131 ms 128012 KB Output is correct
41 Correct 131 ms 128372 KB Output is correct
42 Correct 300 ms 137072 KB Output is correct
43 Correct 299 ms 137100 KB Output is correct
44 Correct 308 ms 137144 KB Output is correct
45 Correct 282 ms 132188 KB Output is correct
46 Correct 178 ms 157636 KB Output is correct
47 Correct 209 ms 157908 KB Output is correct
48 Correct 236 ms 158636 KB Output is correct
49 Correct 243 ms 158632 KB Output is correct
50 Correct 139 ms 131520 KB Output is correct
51 Correct 165 ms 118712 KB Output is correct
52 Correct 231 ms 158936 KB Output is correct
53 Correct 237 ms 160196 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 90940 KB Output is correct
2 Correct 115 ms 90812 KB Output is correct
3 Correct 136 ms 91088 KB Output is correct
4 Correct 11 ms 61784 KB Output is correct
5 Correct 142 ms 90896 KB Output is correct
6 Correct 134 ms 90888 KB Output is correct
7 Correct 131 ms 90960 KB Output is correct
8 Correct 127 ms 90744 KB Output is correct
9 Correct 131 ms 90964 KB Output is correct
10 Correct 133 ms 90960 KB Output is correct
11 Correct 133 ms 90656 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 35672 KB Output is correct
2 Correct 12 ms 35696 KB Output is correct
3 Correct 16 ms 38236 KB Output is correct
4 Correct 14 ms 37724 KB Output is correct
5 Correct 12 ms 35932 KB Output is correct
6 Correct 11 ms 63836 KB Output is correct
7 Correct 792 ms 343256 KB Output is correct
8 Correct 1517 ms 598224 KB Output is correct
9 Correct 1550 ms 599956 KB Output is correct
10 Correct 1536 ms 600004 KB Output is correct
11 Correct 519 ms 336724 KB Output is correct
12 Correct 856 ms 569432 KB Output is correct
13 Correct 893 ms 575308 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 33884 KB Output is correct
2 Correct 14 ms 36188 KB Output is correct
3 Correct 16 ms 36440 KB Output is correct
4 Correct 21 ms 36184 KB Output is correct
5 Correct 13 ms 36188 KB Output is correct
6 Correct 15 ms 38144 KB Output is correct
7 Correct 18 ms 37464 KB Output is correct
8 Correct 20 ms 36952 KB Output is correct
9 Correct 16 ms 38236 KB Output is correct
10 Correct 15 ms 38236 KB Output is correct
11 Correct 13 ms 38184 KB Output is correct
12 Correct 14 ms 38236 KB Output is correct
13 Correct 11 ms 35544 KB Output is correct
14 Correct 15 ms 36128 KB Output is correct
15 Correct 11 ms 36188 KB Output is correct
16 Correct 11 ms 35672 KB Output is correct
17 Correct 23 ms 43100 KB Output is correct
18 Correct 20 ms 43088 KB Output is correct
19 Correct 23 ms 43092 KB Output is correct
20 Correct 22 ms 42840 KB Output is correct
21 Correct 20 ms 42844 KB Output is correct
22 Correct 20 ms 42844 KB Output is correct
23 Correct 22 ms 43100 KB Output is correct
24 Correct 19 ms 65112 KB Output is correct
25 Correct 46 ms 82488 KB Output is correct
26 Correct 43 ms 82632 KB Output is correct
27 Correct 51 ms 53960 KB Output is correct
28 Correct 39 ms 53736 KB Output is correct
29 Correct 63 ms 53704 KB Output is correct
30 Correct 42 ms 53704 KB Output is correct
31 Correct 41 ms 53632 KB Output is correct
32 Correct 41 ms 53424 KB Output is correct
33 Correct 132 ms 128044 KB Output is correct
34 Correct 157 ms 128080 KB Output is correct
35 Correct 131 ms 128012 KB Output is correct
36 Correct 131 ms 128372 KB Output is correct
37 Correct 300 ms 137072 KB Output is correct
38 Correct 299 ms 137100 KB Output is correct
39 Correct 308 ms 137144 KB Output is correct
40 Correct 282 ms 132188 KB Output is correct
41 Correct 178 ms 157636 KB Output is correct
42 Correct 209 ms 157908 KB Output is correct
43 Correct 236 ms 158636 KB Output is correct
44 Correct 243 ms 158632 KB Output is correct
45 Correct 139 ms 131520 KB Output is correct
46 Correct 165 ms 118712 KB Output is correct
47 Correct 231 ms 158936 KB Output is correct
48 Correct 237 ms 160196 KB Output is correct
49 Correct 129 ms 90940 KB Output is correct
50 Correct 115 ms 90812 KB Output is correct
51 Correct 136 ms 91088 KB Output is correct
52 Correct 11 ms 61784 KB Output is correct
53 Correct 142 ms 90896 KB Output is correct
54 Correct 134 ms 90888 KB Output is correct
55 Correct 131 ms 90960 KB Output is correct
56 Correct 127 ms 90744 KB Output is correct
57 Correct 131 ms 90964 KB Output is correct
58 Correct 133 ms 90960 KB Output is correct
59 Correct 133 ms 90656 KB Output is correct
60 Correct 11 ms 63836 KB Output is correct
61 Correct 792 ms 343256 KB Output is correct
62 Correct 1517 ms 598224 KB Output is correct
63 Correct 1550 ms 599956 KB Output is correct
64 Correct 1536 ms 600004 KB Output is correct
65 Correct 519 ms 336724 KB Output is correct
66 Correct 856 ms 569432 KB Output is correct
67 Correct 893 ms 575308 KB Output is correct
68 Correct 11 ms 35672 KB Output is correct
69 Correct 12 ms 35696 KB Output is correct
70 Correct 16 ms 38236 KB Output is correct
71 Correct 14 ms 37724 KB Output is correct
72 Correct 12 ms 35932 KB Output is correct
73 Correct 1035 ms 561336 KB Output is correct
74 Correct 1121 ms 603404 KB Output is correct
75 Correct 1033 ms 603412 KB Output is correct
76 Correct 1085 ms 603180 KB Output is correct
77 Correct 3545 ms 716392 KB Output is correct
78 Correct 1529 ms 414764 KB Output is correct
79 Correct 1660 ms 517600 KB Output is correct
80 Correct 2516 ms 634292 KB Output is correct
81 Correct 1595 ms 427816 KB Output is correct
82 Correct 2067 ms 602828 KB Output is correct
83 Correct 2551 ms 656248 KB Output is correct
84 Correct 1526 ms 423116 KB Output is correct
85 Correct 2583 ms 658724 KB Output is correct
86 Correct 2424 ms 644120 KB Output is correct
87 Correct 2107 ms 571756 KB Output is correct
88 Correct 3601 ms 715168 KB Output is correct
89 Correct 3477 ms 715512 KB Output is correct
90 Correct 3654 ms 715348 KB Output is correct