oj.uz

답안 #928819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928819 2024-02-17T06:19:48 Z knon0501 Rectangles (IOI19_rect) C++17
59 / 100
 1362 ms 1048576 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

vector<short> b[2505][2505];
vector<short> c[2505][2505];
vector<pair<short,short>> d[2505][2505];
vector<pair<short,short>> e[2505][2505];
short lef[2505][2505];
short rig[2505][2505];
short up[2505][2505];
short down[2505][2505];
vector<vector<short>> v;

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);
		}
	}

	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,y});
					y=x;
				}
				prv=x;
			}
			if(prv>=0){

				d[i][j].push_back({prv,y});
			}
			sort(d[i][j].begin(),d[i][j].end());


		}
	}
	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,y});
					y=x;
				}
				prv=x;
			}
			if(prv>=0){
			
				e[i][j].push_back({prv,y});
			}
			sort(e[i][j].begin(),e[i][j].end());
	

		}
	}
	
	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];
			v.push_back({x,y,z,w});
			
		}
	}
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
	for(auto vv: v){
		int x=vv[0];
		int y = vv[1];
		int z =vv[2];
		int  w = vv[3];
		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(),(pair<short,short>){z+1,1e9});
			if(k== d[x+1][y-1].begin())continue;
		
			if((--k)->second <w-1)continue;
			
			//cout<<z+1<<" "<<w-1<<" "<<e[z+1][w-1].size()<<" "<<c[z+1][w-1].size()<<endl;
			auto t = upper_bound(e[z+1][w-1].begin(),e[z+1][w-1].end(),(pair<short,short>){x+1,1e9});
			
			if(t== e[z+1][w-1].begin())continue;
			
			if((--t)->second <y-1)continue;
			ans++;
	}
	return ans;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 597584 KB Output is correct
2 Correct 132 ms 597944 KB Output is correct
3 Correct 134 ms 597828 KB Output is correct
4 Correct 134 ms 598004 KB Output is correct
5 Correct 131 ms 598136 KB Output is correct
6 Correct 130 ms 597844 KB Output is correct
7 Correct 130 ms 597904 KB Output is correct
8 Correct 133 ms 597840 KB Output is correct
9 Correct 130 ms 597844 KB Output is correct
10 Correct 131 ms 597844 KB Output is correct
11 Correct 128 ms 597840 KB Output is correct
12 Correct 133 ms 598096 KB Output is correct
13 Correct 128 ms 591440 KB Output is correct
14 Correct 127 ms 595476 KB Output is correct
15 Correct 128 ms 597588 KB Output is correct
16 Correct 135 ms 597568 KB Output is correct
17 Correct 130 ms 591444 KB Output is correct
18 Correct 133 ms 593492 KB Output is correct
19 Correct 132 ms 597936 KB Output is correct
20 Correct 128 ms 597872 KB Output is correct
21 Correct 127 ms 595640 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 597584 KB Output is correct
2 Correct 132 ms 597944 KB Output is correct
3 Correct 134 ms 597828 KB Output is correct
4 Correct 134 ms 598004 KB Output is correct
5 Correct 131 ms 598136 KB Output is correct
6 Correct 130 ms 597844 KB Output is correct
7 Correct 130 ms 597904 KB Output is correct
8 Correct 133 ms 597840 KB Output is correct
9 Correct 130 ms 597844 KB Output is correct
10 Correct 131 ms 597844 KB Output is correct
11 Correct 128 ms 597840 KB Output is correct
12 Correct 133 ms 598096 KB Output is correct
13 Correct 128 ms 591440 KB Output is correct
14 Correct 127 ms 595476 KB Output is correct
15 Correct 128 ms 597588 KB Output is correct
16 Correct 135 ms 597568 KB Output is correct
17 Correct 130 ms 591444 KB Output is correct
18 Correct 133 ms 593492 KB Output is correct
19 Correct 132 ms 597936 KB Output is correct
20 Correct 128 ms 597872 KB Output is correct
21 Correct 127 ms 595640 KB Output is correct
22 Correct 131 ms 606548 KB Output is correct
23 Correct 137 ms 606480 KB Output is correct
24 Correct 132 ms 606800 KB Output is correct
25 Correct 141 ms 606612 KB Output is correct
26 Correct 136 ms 606548 KB Output is correct
27 Correct 135 ms 606812 KB Output is correct
28 Correct 133 ms 606504 KB Output is correct
29 Correct 132 ms 606388 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 597584 KB Output is correct
2 Correct 132 ms 597944 KB Output is correct
3 Correct 134 ms 597828 KB Output is correct
4 Correct 134 ms 598004 KB Output is correct
5 Correct 131 ms 598136 KB Output is correct
6 Correct 130 ms 597844 KB Output is correct
7 Correct 130 ms 597904 KB Output is correct
8 Correct 133 ms 597840 KB Output is correct
9 Correct 130 ms 597844 KB Output is correct
10 Correct 131 ms 597844 KB Output is correct
11 Correct 128 ms 597840 KB Output is correct
12 Correct 133 ms 598096 KB Output is correct
13 Correct 128 ms 591440 KB Output is correct
14 Correct 127 ms 595476 KB Output is correct
15 Correct 128 ms 597588 KB Output is correct
16 Correct 135 ms 597568 KB Output is correct
17 Correct 131 ms 606548 KB Output is correct
18 Correct 137 ms 606480 KB Output is correct
19 Correct 132 ms 606800 KB Output is correct
20 Correct 141 ms 606612 KB Output is correct
21 Correct 136 ms 606548 KB Output is correct
22 Correct 135 ms 606812 KB Output is correct
23 Correct 133 ms 606504 KB Output is correct
24 Correct 132 ms 606388 KB Output is correct
25 Correct 130 ms 591444 KB Output is correct
26 Correct 133 ms 593492 KB Output is correct
27 Correct 132 ms 597936 KB Output is correct
28 Correct 128 ms 597872 KB Output is correct
29 Correct 127 ms 595640 KB Output is correct
30 Correct 140 ms 609036 KB Output is correct
31 Correct 140 ms 609032 KB Output is correct
32 Correct 146 ms 609020 KB Output is correct
33 Correct 146 ms 609292 KB Output is correct
34 Correct 147 ms 609804 KB Output is correct
35 Correct 149 ms 609796 KB Output is correct
36 Correct 148 ms 609544 KB Output is correct
37 Correct 149 ms 609544 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 597584 KB Output is correct
2 Correct 132 ms 597944 KB Output is correct
3 Correct 134 ms 597828 KB Output is correct
4 Correct 134 ms 598004 KB Output is correct
5 Correct 131 ms 598136 KB Output is correct
6 Correct 130 ms 597844 KB Output is correct
7 Correct 130 ms 597904 KB Output is correct
8 Correct 133 ms 597840 KB Output is correct
9 Correct 130 ms 597844 KB Output is correct
10 Correct 131 ms 597844 KB Output is correct
11 Correct 128 ms 597840 KB Output is correct
12 Correct 133 ms 598096 KB Output is correct
13 Correct 128 ms 591440 KB Output is correct
14 Correct 127 ms 595476 KB Output is correct
15 Correct 128 ms 597588 KB Output is correct
16 Correct 135 ms 597568 KB Output is correct
17 Correct 131 ms 606548 KB Output is correct
18 Correct 137 ms 606480 KB Output is correct
19 Correct 132 ms 606800 KB Output is correct
20 Correct 141 ms 606612 KB Output is correct
21 Correct 136 ms 606548 KB Output is correct
22 Correct 135 ms 606812 KB Output is correct
23 Correct 133 ms 606504 KB Output is correct
24 Correct 132 ms 606388 KB Output is correct
25 Correct 140 ms 609036 KB Output is correct
26 Correct 140 ms 609032 KB Output is correct
27 Correct 146 ms 609020 KB Output is correct
28 Correct 146 ms 609292 KB Output is correct
29 Correct 147 ms 609804 KB Output is correct
30 Correct 149 ms 609796 KB Output is correct
31 Correct 148 ms 609544 KB Output is correct
32 Correct 149 ms 609544 KB Output is correct
33 Correct 130 ms 591444 KB Output is correct
34 Correct 133 ms 593492 KB Output is correct
35 Correct 132 ms 597936 KB Output is correct
36 Correct 128 ms 597872 KB Output is correct
37 Correct 127 ms 595640 KB Output is correct
38 Correct 323 ms 675500 KB Output is correct
39 Correct 323 ms 675900 KB Output is correct
40 Correct 315 ms 676088 KB Output is correct
41 Correct 285 ms 675748 KB Output is correct
42 Correct 305 ms 648108 KB Output is correct
43 Correct 297 ms 647672 KB Output is correct
44 Correct 310 ms 648292 KB Output is correct
45 Correct 288 ms 646912 KB Output is correct
46 Correct 309 ms 647528 KB Output is correct
47 Correct 327 ms 648752 KB Output is correct
48 Correct 406 ms 655668 KB Output is correct
49 Correct 376 ms 655464 KB Output is correct
50 Correct 285 ms 634912 KB Output is correct
51 Correct 264 ms 626936 KB Output is correct
52 Correct 397 ms 652660 KB Output is correct
53 Correct 373 ms 652344 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 597988 KB Output is correct
2 Correct 136 ms 597892 KB Output is correct
3 Correct 140 ms 597844 KB Output is correct
4 Correct 132 ms 595540 KB Output is correct
5 Correct 145 ms 598088 KB Output is correct
6 Correct 139 ms 598020 KB Output is correct
7 Correct 140 ms 598100 KB Output is correct
8 Correct 139 ms 598100 KB Output is correct
9 Correct 143 ms 598100 KB Output is correct
10 Correct 136 ms 593492 KB Output is correct
11 Correct 138 ms 593492 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 591444 KB Output is correct
2 Correct 133 ms 593492 KB Output is correct
3 Correct 132 ms 597936 KB Output is correct
4 Correct 128 ms 597872 KB Output is correct
5 Correct 127 ms 595640 KB Output is correct
6 Correct 136 ms 597784 KB Output is correct
7 Correct 1362 ms 825052 KB Output is correct
8 Runtime error 890 ms 1048576 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 597584 KB Output is correct
2 Correct 132 ms 597944 KB Output is correct
3 Correct 134 ms 597828 KB Output is correct
4 Correct 134 ms 598004 KB Output is correct
5 Correct 131 ms 598136 KB Output is correct
6 Correct 130 ms 597844 KB Output is correct
7 Correct 130 ms 597904 KB Output is correct
8 Correct 133 ms 597840 KB Output is correct
9 Correct 130 ms 597844 KB Output is correct
10 Correct 131 ms 597844 KB Output is correct
11 Correct 128 ms 597840 KB Output is correct
12 Correct 133 ms 598096 KB Output is correct
13 Correct 128 ms 591440 KB Output is correct
14 Correct 127 ms 595476 KB Output is correct
15 Correct 128 ms 597588 KB Output is correct
16 Correct 135 ms 597568 KB Output is correct
17 Correct 131 ms 606548 KB Output is correct
18 Correct 137 ms 606480 KB Output is correct
19 Correct 132 ms 606800 KB Output is correct
20 Correct 141 ms 606612 KB Output is correct
21 Correct 136 ms 606548 KB Output is correct
22 Correct 135 ms 606812 KB Output is correct
23 Correct 133 ms 606504 KB Output is correct
24 Correct 132 ms 606388 KB Output is correct
25 Correct 140 ms 609036 KB Output is correct
26 Correct 140 ms 609032 KB Output is correct
27 Correct 146 ms 609020 KB Output is correct
28 Correct 146 ms 609292 KB Output is correct
29 Correct 147 ms 609804 KB Output is correct
30 Correct 149 ms 609796 KB Output is correct
31 Correct 148 ms 609544 KB Output is correct
32 Correct 149 ms 609544 KB Output is correct
33 Correct 323 ms 675500 KB Output is correct
34 Correct 323 ms 675900 KB Output is correct
35 Correct 315 ms 676088 KB Output is correct
36 Correct 285 ms 675748 KB Output is correct
37 Correct 305 ms 648108 KB Output is correct
38 Correct 297 ms 647672 KB Output is correct
39 Correct 310 ms 648292 KB Output is correct
40 Correct 288 ms 646912 KB Output is correct
41 Correct 309 ms 647528 KB Output is correct
42 Correct 327 ms 648752 KB Output is correct
43 Correct 406 ms 655668 KB Output is correct
44 Correct 376 ms 655464 KB Output is correct
45 Correct 285 ms 634912 KB Output is correct
46 Correct 264 ms 626936 KB Output is correct
47 Correct 397 ms 652660 KB Output is correct
48 Correct 373 ms 652344 KB Output is correct
49 Correct 147 ms 597988 KB Output is correct
50 Correct 136 ms 597892 KB Output is correct
51 Correct 140 ms 597844 KB Output is correct
52 Correct 132 ms 595540 KB Output is correct
53 Correct 145 ms 598088 KB Output is correct
54 Correct 139 ms 598020 KB Output is correct
55 Correct 140 ms 598100 KB Output is correct
56 Correct 139 ms 598100 KB Output is correct
57 Correct 143 ms 598100 KB Output is correct
58 Correct 136 ms 593492 KB Output is correct
59 Correct 138 ms 593492 KB Output is correct
60 Correct 136 ms 597784 KB Output is correct
61 Correct 1362 ms 825052 KB Output is correct
62 Runtime error 890 ms 1048576 KB Execution killed with signal 9
63 Halted 0 ms 0 KB -