oj.uz

Submission #928851

# Submission time Handle Problem Language Result Execution time Memory
928851 2024-02-17T06:48:00 Z knon0501 Rectangles (IOI19_rect) C++14
100 / 100
 2467 ms 932284 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

vector<short> b[2505][2505];
vector<short> c[2505][2505];
vector<int> d[2505][2505];
vector<int> e[2505][2505];
short lef[2505][2505];
short rig[2505][2505];
short up[2505][2505];
short down[2505][2505];
long long v[2501*2501];

long long count_rectangles(std::vector<std::vector<int> > a) {



	int n = a.size();
	int m = a[0].size();


	
	
	
	for(int i=1 ; i<n-1 ; i++){
		stack<int> S;

		for(int j=0 ; j<m ; j++){
			bool flag = true;
			while(!S.empty() && a[i][S.top()] <=  a[i][j]){
				int x = S.top(); 
				
				
				if(x +1 <j && flag)
					b[x+1][j-1].push_back(i);
				if(a[i][S.top()]==a[i][j])flag=false;
				S.pop();
				
			}
			if(!S.empty() ){
				int x = S.top();
				lef[i][j] = x;
				if(x+1<j && flag)
					b[x+1][j-1].push_back(i);
			}
			else{
				lef[i][j]=-1;
			}
			S.push(j);
		}
		while(!S.empty())S.pop();
		for(int j=m-1; j>=0 ; j--){
		
			while(!S.empty() && a[i][S.top()] <=  a[i][j]){
				
				S.pop();
				
			}
			if(!S.empty() ){
				int x = S.top();
				rig[i][j] = x;
				
			}
			else{
				rig[i][j]=-1;
			}
			S.push(j);
		}
	}


	for(int i=1 ; i<m-1 ; i++){
		stack<int> S;

		for(int j=0 ; j<n ; j++){
			bool flag = true;
			while(!S.empty() && a[S.top()][i] <=  a[j][i]){
				int x = S.top(); 
				
				
				if(x +1 <j && flag)
					c[x+1][j-1].push_back(i);
				if(a[S.top()][i]==a[j][i])flag=false;
				S.pop();
				
			}
			
			if(!S.empty() ){
				
				int x = S.top();
		
				up[j][i]=x;
				if(x+1<j && flag)
					c[x+1][j-1].push_back(i);
			}
			else{
				up[j][i]=-1;
			}
			S.push(j);
		}
		while(!S.empty())S.pop();
		for(int j=n-1 ; j>=0 ; j--){
			while(!S.empty() && a[S.top()][i] <=  a[j][i]){
			
				S.pop();
				
			}
			if(!S.empty() ){
				int x = S.top();
				down[j][i]=x;	
			}
			else{
				down[j][i]=-1;
			}
			S.push(j);
		}
	}
	std::vector<vector<int>>().swap(a);
	long long ans = 0;
	for(int i=1 ; i<m ; i++){
		for(int j=i ; j<m ; j++){
			reverse(b[i][j].begin(),b[i][j].end());
			int prv = -1;
			int y;
			for(auto x: b[i][j]){
				if(x != prv-1){
					if(prv>=0)
						d[i][j].push_back(prv*2501+y);
					y=x;
				}
				prv=x;
			}
			if(prv>=0){

				d[i][j].push_back(prv*2501+y);
			}
			sort(d[i][j].begin(),d[i][j].end());
			std::vector<short>().swap(b[i][j]);

		}
	}
	for(int i=1 ; i<n  ; i++){
		for(int j=i ; j<n ; j++){
			reverse(c[i][j].begin(),c[i][j].end());
			int prv = -1;
			int y;
			for(auto x: c[i][j]){
				if(x != prv-1){
					if(prv>=0)
						e[i][j].push_back(prv*2501+y);
					y=x;
				}
				prv=x;
			}
			if(prv>=0){
			
				e[i][j].push_back(prv*2501+y);
			}
			sort(e[i][j].begin(),e[i][j].end());
			std::vector<short>().swap(c[i][j]);

		}
	}
	int nn = 0;
	for(int i = 1 ; i<n-1 ; i++){
		for(int j=1 ; j<m-1 ; j++){
			short x = lef[i][j];
			short y = rig[i][j];
			short z = up[i][j];
			short w = down[i][j];
			if(x==-1 || y==-1 || z==-1 || w==-1)continue;
			v[++nn]=x + 2501ll*y + 2501ll*2501ll*z+2501ll*2501*2501*w;
			
		}
	}
	sort(v+1,v+nn+1);

	for(int i=1 ; i<=nn ; i++){
		if(v[i]==v[i-1])continue;
	
		
		int x = v[i]%2501;
		int y = v[i]/2501%2501;
		int z = v[i]/2501/2501%2501;
		int w = v[i]/2501/2501/2501%2501;
		//cout<<x<<" "<<y<<" "<<z<<" "<<w<<endl;
		if(x==-1 ||y==-1 || z==-1 || w==-1)continue;

	
			auto k = upper_bound(d[x+1][y-1].begin(),d[x+1][y-1].end(),(z+1)*2501+2500);
			if(k== d[x+1][y-1].begin())continue;
			
			if(*(--k)%2501 <w-1)continue;
			
			
			auto t = upper_bound(e[z+1][w-1].begin(),e[z+1][w-1].end(),(x+1)*2501+2500);
			
			if(t== e[z+1][w-1].begin())continue;
		
			if(*(--t)%2501 <y-1)continue;
			ans++;
	}
	return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:158:31: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
  158 |     e[i][j].push_back(prv*2501+y);
      |                       ~~~~~~~~^~
rect.cpp:136:31: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
  136 |     d[i][j].push_back(prv*2501+y);
      |                       ~~~~~~~~^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 599512 KB Output is correct
2 Correct 131 ms 599484 KB Output is correct
3 Correct 129 ms 599376 KB Output is correct
4 Correct 130 ms 599376 KB Output is correct
5 Correct 131 ms 599636 KB Output is correct
6 Correct 130 ms 599492 KB Output is correct
7 Correct 131 ms 599380 KB Output is correct
8 Correct 128 ms 599476 KB Output is correct
9 Correct 132 ms 599376 KB Output is correct
10 Correct 129 ms 599380 KB Output is correct
11 Correct 130 ms 599380 KB Output is correct
12 Correct 133 ms 599380 KB Output is correct
13 Correct 128 ms 591188 KB Output is correct
14 Correct 128 ms 595280 KB Output is correct
15 Correct 144 ms 599384 KB Output is correct
16 Correct 133 ms 599340 KB Output is correct
17 Correct 132 ms 591284 KB Output is correct
18 Correct 149 ms 595344 KB Output is correct
19 Correct 128 ms 599464 KB Output is correct
20 Correct 132 ms 599472 KB Output is correct
21 Correct 130 ms 595368 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 599512 KB Output is correct
2 Correct 131 ms 599484 KB Output is correct
3 Correct 129 ms 599376 KB Output is correct
4 Correct 130 ms 599376 KB Output is correct
5 Correct 131 ms 599636 KB Output is correct
6 Correct 130 ms 599492 KB Output is correct
7 Correct 131 ms 599380 KB Output is correct
8 Correct 128 ms 599476 KB Output is correct
9 Correct 132 ms 599376 KB Output is correct
10 Correct 129 ms 599380 KB Output is correct
11 Correct 130 ms 599380 KB Output is correct
12 Correct 133 ms 599380 KB Output is correct
13 Correct 128 ms 591188 KB Output is correct
14 Correct 128 ms 595280 KB Output is correct
15 Correct 144 ms 599384 KB Output is correct
16 Correct 133 ms 599340 KB Output is correct
17 Correct 132 ms 591284 KB Output is correct
18 Correct 149 ms 595344 KB Output is correct
19 Correct 128 ms 599464 KB Output is correct
20 Correct 132 ms 599472 KB Output is correct
21 Correct 130 ms 595368 KB Output is correct
22 Correct 139 ms 599484 KB Output is correct
23 Correct 131 ms 599560 KB Output is correct
24 Correct 133 ms 599560 KB Output is correct
25 Correct 131 ms 599632 KB Output is correct
26 Correct 132 ms 599632 KB Output is correct
27 Correct 133 ms 599588 KB Output is correct
28 Correct 131 ms 599560 KB Output is correct
29 Correct 133 ms 599380 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 599512 KB Output is correct
2 Correct 131 ms 599484 KB Output is correct
3 Correct 129 ms 599376 KB Output is correct
4 Correct 130 ms 599376 KB Output is correct
5 Correct 131 ms 599636 KB Output is correct
6 Correct 130 ms 599492 KB Output is correct
7 Correct 131 ms 599380 KB Output is correct
8 Correct 128 ms 599476 KB Output is correct
9 Correct 132 ms 599376 KB Output is correct
10 Correct 129 ms 599380 KB Output is correct
11 Correct 130 ms 599380 KB Output is correct
12 Correct 133 ms 599380 KB Output is correct
13 Correct 128 ms 591188 KB Output is correct
14 Correct 128 ms 595280 KB Output is correct
15 Correct 144 ms 599384 KB Output is correct
16 Correct 133 ms 599340 KB Output is correct
17 Correct 139 ms 599484 KB Output is correct
18 Correct 131 ms 599560 KB Output is correct
19 Correct 133 ms 599560 KB Output is correct
20 Correct 131 ms 599632 KB Output is correct
21 Correct 132 ms 599632 KB Output is correct
22 Correct 133 ms 599588 KB Output is correct
23 Correct 131 ms 599560 KB Output is correct
24 Correct 133 ms 599380 KB Output is correct
25 Correct 132 ms 591284 KB Output is correct
26 Correct 149 ms 595344 KB Output is correct
27 Correct 128 ms 599464 KB Output is correct
28 Correct 132 ms 599472 KB Output is correct
29 Correct 130 ms 595368 KB Output is correct
30 Correct 134 ms 610388 KB Output is correct
31 Correct 134 ms 610384 KB Output is correct
32 Correct 138 ms 610388 KB Output is correct
33 Correct 139 ms 610384 KB Output is correct
34 Correct 147 ms 610704 KB Output is correct
35 Correct 153 ms 610600 KB Output is correct
36 Correct 147 ms 610384 KB Output is correct
37 Correct 141 ms 610472 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 599512 KB Output is correct
2 Correct 131 ms 599484 KB Output is correct
3 Correct 129 ms 599376 KB Output is correct
4 Correct 130 ms 599376 KB Output is correct
5 Correct 131 ms 599636 KB Output is correct
6 Correct 130 ms 599492 KB Output is correct
7 Correct 131 ms 599380 KB Output is correct
8 Correct 128 ms 599476 KB Output is correct
9 Correct 132 ms 599376 KB Output is correct
10 Correct 129 ms 599380 KB Output is correct
11 Correct 130 ms 599380 KB Output is correct
12 Correct 133 ms 599380 KB Output is correct
13 Correct 128 ms 591188 KB Output is correct
14 Correct 128 ms 595280 KB Output is correct
15 Correct 144 ms 599384 KB Output is correct
16 Correct 133 ms 599340 KB Output is correct
17 Correct 139 ms 599484 KB Output is correct
18 Correct 131 ms 599560 KB Output is correct
19 Correct 133 ms 599560 KB Output is correct
20 Correct 131 ms 599632 KB Output is correct
21 Correct 132 ms 599632 KB Output is correct
22 Correct 133 ms 599588 KB Output is correct
23 Correct 131 ms 599560 KB Output is correct
24 Correct 133 ms 599380 KB Output is correct
25 Correct 134 ms 610388 KB Output is correct
26 Correct 134 ms 610384 KB Output is correct
27 Correct 138 ms 610388 KB Output is correct
28 Correct 139 ms 610384 KB Output is correct
29 Correct 147 ms 610704 KB Output is correct
30 Correct 153 ms 610600 KB Output is correct
31 Correct 147 ms 610384 KB Output is correct
32 Correct 141 ms 610472 KB Output is correct
33 Correct 132 ms 591284 KB Output is correct
34 Correct 149 ms 595344 KB Output is correct
35 Correct 128 ms 599464 KB Output is correct
36 Correct 132 ms 599472 KB Output is correct
37 Correct 130 ms 595368 KB Output is correct
38 Correct 205 ms 635100 KB Output is correct
39 Correct 199 ms 634876 KB Output is correct
40 Correct 194 ms 634964 KB Output is correct
41 Correct 193 ms 635104 KB Output is correct
42 Correct 187 ms 626184 KB Output is correct
43 Correct 198 ms 626024 KB Output is correct
44 Correct 188 ms 626220 KB Output is correct
45 Correct 188 ms 625924 KB Output is correct
46 Correct 191 ms 622928 KB Output is correct
47 Correct 213 ms 625276 KB Output is correct
48 Correct 291 ms 628308 KB Output is correct
49 Correct 275 ms 628560 KB Output is correct
50 Correct 207 ms 622420 KB Output is correct
51 Correct 202 ms 614224 KB Output is correct
52 Correct 258 ms 627420 KB Output is correct
53 Correct 253 ms 627240 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 599632 KB Output is correct
2 Correct 152 ms 599672 KB Output is correct
3 Correct 141 ms 599380 KB Output is correct
4 Correct 131 ms 595284 KB Output is correct
5 Correct 144 ms 599632 KB Output is correct
6 Correct 143 ms 599636 KB Output is correct
7 Correct 143 ms 599648 KB Output is correct
8 Correct 142 ms 599632 KB Output is correct
9 Correct 140 ms 599636 KB Output is correct
10 Correct 143 ms 595280 KB Output is correct
11 Correct 139 ms 595288 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 591284 KB Output is correct
2 Correct 149 ms 595344 KB Output is correct
3 Correct 128 ms 599464 KB Output is correct
4 Correct 132 ms 599472 KB Output is correct
5 Correct 130 ms 595368 KB Output is correct
6 Correct 131 ms 599472 KB Output is correct
7 Correct 536 ms 664380 KB Output is correct
8 Correct 1064 ms 725220 KB Output is correct
9 Correct 1052 ms 725432 KB Output is correct
10 Correct 1043 ms 726236 KB Output is correct
11 Correct 264 ms 648276 KB Output is correct
12 Correct 415 ms 686420 KB Output is correct
13 Correct 420 ms 689800 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 599512 KB Output is correct
2 Correct 131 ms 599484 KB Output is correct
3 Correct 129 ms 599376 KB Output is correct
4 Correct 130 ms 599376 KB Output is correct
5 Correct 131 ms 599636 KB Output is correct
6 Correct 130 ms 599492 KB Output is correct
7 Correct 131 ms 599380 KB Output is correct
8 Correct 128 ms 599476 KB Output is correct
9 Correct 132 ms 599376 KB Output is correct
10 Correct 129 ms 599380 KB Output is correct
11 Correct 130 ms 599380 KB Output is correct
12 Correct 133 ms 599380 KB Output is correct
13 Correct 128 ms 591188 KB Output is correct
14 Correct 128 ms 595280 KB Output is correct
15 Correct 144 ms 599384 KB Output is correct
16 Correct 133 ms 599340 KB Output is correct
17 Correct 139 ms 599484 KB Output is correct
18 Correct 131 ms 599560 KB Output is correct
19 Correct 133 ms 599560 KB Output is correct
20 Correct 131 ms 599632 KB Output is correct
21 Correct 132 ms 599632 KB Output is correct
22 Correct 133 ms 599588 KB Output is correct
23 Correct 131 ms 599560 KB Output is correct
24 Correct 133 ms 599380 KB Output is correct
25 Correct 134 ms 610388 KB Output is correct
26 Correct 134 ms 610384 KB Output is correct
27 Correct 138 ms 610388 KB Output is correct
28 Correct 139 ms 610384 KB Output is correct
29 Correct 147 ms 610704 KB Output is correct
30 Correct 153 ms 610600 KB Output is correct
31 Correct 147 ms 610384 KB Output is correct
32 Correct 141 ms 610472 KB Output is correct
33 Correct 205 ms 635100 KB Output is correct
34 Correct 199 ms 634876 KB Output is correct
35 Correct 194 ms 634964 KB Output is correct
36 Correct 193 ms 635104 KB Output is correct
37 Correct 187 ms 626184 KB Output is correct
38 Correct 198 ms 626024 KB Output is correct
39 Correct 188 ms 626220 KB Output is correct
40 Correct 188 ms 625924 KB Output is correct
41 Correct 191 ms 622928 KB Output is correct
42 Correct 213 ms 625276 KB Output is correct
43 Correct 291 ms 628308 KB Output is correct
44 Correct 275 ms 628560 KB Output is correct
45 Correct 207 ms 622420 KB Output is correct
46 Correct 202 ms 614224 KB Output is correct
47 Correct 258 ms 627420 KB Output is correct
48 Correct 253 ms 627240 KB Output is correct
49 Correct 142 ms 599632 KB Output is correct
50 Correct 152 ms 599672 KB Output is correct
51 Correct 141 ms 599380 KB Output is correct
52 Correct 131 ms 595284 KB Output is correct
53 Correct 144 ms 599632 KB Output is correct
54 Correct 143 ms 599636 KB Output is correct
55 Correct 143 ms 599648 KB Output is correct
56 Correct 142 ms 599632 KB Output is correct
57 Correct 140 ms 599636 KB Output is correct
58 Correct 143 ms 595280 KB Output is correct
59 Correct 139 ms 595288 KB Output is correct
60 Correct 131 ms 599472 KB Output is correct
61 Correct 536 ms 664380 KB Output is correct
62 Correct 1064 ms 725220 KB Output is correct
63 Correct 1052 ms 725432 KB Output is correct
64 Correct 1043 ms 726236 KB Output is correct
65 Correct 264 ms 648276 KB Output is correct
66 Correct 415 ms 686420 KB Output is correct
67 Correct 420 ms 689800 KB Output is correct
68 Correct 132 ms 591284 KB Output is correct
69 Correct 149 ms 595344 KB Output is correct
70 Correct 128 ms 599464 KB Output is correct
71 Correct 132 ms 599472 KB Output is correct
72 Correct 130 ms 595368 KB Output is correct
73 Correct 1294 ms 932284 KB Output is correct
74 Correct 1178 ms 932048 KB Output is correct
75 Correct 1178 ms 931996 KB Output is correct
76 Correct 982 ms 931852 KB Output is correct
77 Correct 1065 ms 815056 KB Output is correct
78 Correct 1485 ms 733384 KB Output is correct
79 Correct 1492 ms 756828 KB Output is correct
80 Correct 2284 ms 808216 KB Output is correct
81 Correct 1434 ms 751780 KB Output is correct
82 Correct 1889 ms 796156 KB Output is correct
83 Correct 2467 ms 835364 KB Output is correct
84 Correct 1212 ms 733684 KB Output is correct
85 Correct 2107 ms 821764 KB Output is correct
86 Correct 1987 ms 817588 KB Output is correct
87 Correct 639 ms 747096 KB Output is correct
88 Correct 1031 ms 807448 KB Output is correct
89 Correct 1044 ms 815396 KB Output is correct
90 Correct 1077 ms 815012 KB Output is correct